Related papers: (Positive) Totally Ordered Noncommutative Monoids …
Let $\M(A,\theta)$ be a free partially commutative monoid. We give here a necessary and sufficient condition on a subalphabet $B\subset A$ such that the right factor of a bisection $\M(A,\theta)=\M(B,\theta\_B).T$ be also partially…
The paper develops further the theory of quandle rings which was introduced by the authors in a recent work. Orderability of quandles is defined and many interesting examples of orderable quandles are given. It is proved that quandle rings…
The aim of this paper is sketch a theory of divisibility and factorisation in topological monoids, where finite products are replaced by convergent products. The algebraic case can then be viewed as the special case of discretely…
We consider positively supported Borel measures for which all moments exist. On the set of compactly supported measures in this class a partial order is defined via eventual dominance of the moment sequences. Special classes are identified…
We discuss residual finiteness and several related separability conditions for the class of monoid acts, namely weak subact separability, strong subact separability and complete separability. For each of these four separability conditions,…
Abelian groups having partial orderings compatible with their binary operations have long been studied in the literature. In particular, lattice-ordered abelian groups constitute a universal-algebraic variety, and thus form a category which…
As far as algebraic properties are concerned, the usual addition on the class of ordinal numbers is not really well behaved; for example, it is not commutative, nor left cancellative etc. In a few cases, the natural Hessemberg sum is a…
The convention "empty product $=1$" is ubiquitous in mathematics, but often appears without an explicit structural justification. This note provides a self-contained reference to this fact in the context of commutative monoids. We construct…
Let $B$ be a bounded self-adjoint operator and let $A$ be a nonnegative self-adjoint unbounded operator. It is shown that if $BA$ is normal, it must be self-adjoint and so must be $AB$. Commutativity is necessary and sufficient for this…
A monoid $M$ is called surjunctive if every injective cellular automata with finite alphabet over $M$ is surjective. We show that all finite monoids, all finitely generated commutative monoids, all cancellative commutative monoids, all…
Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…
A set $\mathcal{A}\subset \mathbb{N}$ is called additively decomposable (resp. asymptotically additively decomposable) if there exist sets $\mathcal{B},\mathcal{C}\subset \mathbb{N}$ of cardinality at least two each such that…
A theory $T$ is said to be relatively decidable if for every model of $T$, one can compute the elementary diagram of that model from its atomic diagram together with $T$. We verify a conjecture of Chubb, Miller, and Solomon by showing that…
If $\mathcal{C}$ is a cocomplete monoidal category in which tensoring from both sides preserves coequalizers, then the category of monoids over $\mathcal{C}$ is cocomplete. The same holds if $\mathcal{C}$ has regular factorizations and…
We study a nonlinear analogue of additive commutators, known as \textit{polynomial commutators}, defined by $p(ab) - p(ba)$ for a polynomial $p \in F[x]$ and elements $a, b$ in an algebra $R$ over a field $F$. Originally introduced by…
The category of all monads over many-sorted sets (and over other "set-like" categories) is proved to have coequalizers and strong cointersections. And a general diagram has a colimit whenever all the monads involved preserve monomorphisms…
A sumset semigroup is a non-cancellative commutative monoid obtained from the sumset of finite non-negative integer sets. In this work, an algorithm for computing the ideals associated with some sumset semigroups is provided. Using these…
Nonmonotonic logics are usually characterized by the presence of some notion of 'conditional' that fails monotonicity. Research on nonmonotonic logics is therefore largely concerned with the defeasibility of argument forms and the…
The present paper is devoted to the study of dimonoids, algebraic structures with two associative binary operations that satisfy a prescribed system of axioms. We investigate the properties of dual dimonoids. In the class of noncommutative…
It is proved that the first-order theory of the structure (N,mod) is undecidable. Here mod denotes the operation of computing the remainder for any division between positive integers; i.e. x mod y is the remainder obtained by the division x…