Related papers: Abstract clones as noncommutative monoids I
A magmoid is a non-empty set with a partial binary operation; group-like magmoids generalize group-like magmas such as semigroups, monoids and groups. In this article, we first consider the many ways in which the notions of associative…
We study commutative associative polynomial operations $\mathbb{A}^n\times\mathbb{A}^n\to\mathbb{A}^n$ with unit on the affine space $\mathbb{A}^n$ over an algebraically closed field of characteristic zero. A classification of such…
We use compactifications of C*-algebras to introduce noncommutative coarse geometry. We transfer a noncommutative coarse structure on a C*-algebra with an action of a locally compact Abelian group by translations to Rieffel deformations and…
We give a full description of all sets of functions on the group $(\mathbb{ Z}_p, +)$ of prime order which are closed under the composition with the clone generated by $+$ from both sides. Thereby, we also get a description of all iterative…
With any non necessarily orientable unpunctured marked surface (S,M) we associate a commutative algebra, called quasi-cluster algebra, equipped with a distinguished set of generators, called quasi-cluster variables, in bijection with the…
Krebs et al. (2007) gave a characterization of the complexity class TC0 as the class of languages recognized by a certain class of typed monoids. The notion of typed monoid was introduced to extend methods of algebraic automata theory to…
We introduce a theory for encoding and manipulating algebraic data on categories via $\textit{concentration structures}$, which are equivalence relations on morphisms that satisfy certain axioms. For any category with a concentration…
We classify commutative algebraic monoid structures on normal affine surfaces over an algebraically closed field of characteristic zero. The answer is given in two languages: comultiplications and Cox coordinates. The result follows from a…
Arithmetical invariants---such as sets of lengths, catenary and tame degrees---describe the non-uniqueness of factorizations in atomic monoids. We study these arithmetical invariants by the monoid of relations and by presentations of the…
Sorting algorithms are fundamental to computer science, and their correctness criteria are well understood as rearranging elements of a list according to a specified total order on the underlying set of elements. As mathematical functions,…
We provide an abstract categorical framework that relates the Cuntz semigroups of the C$^*$-algebras $A$ and $A\otimes \mathcal{K}$. This is done through a certain completion of ordered monoids by adding suprema of countable ascending…
We determine the atoms of the interval of the clone lattice consisting of those clones which contain all permutations, on an infinite base set. This is equivalent to the description of the atoms of the lattice of transformation monoids…
We discuss generalizations of the notion of i) the group of unitary elements of a (real or complex) finite dimensional C*-algebra, ii) gauge transformations and iii) (real) automorphisms, in the framework of compact quantum group theory and…
Expansion of higher transcendental functions in a small parameter are needed in many areas of science. For certain classes of functions this can be achieved by algebraic means. These algebraic tools are based on nested sums and can be…
In this paper we introduce Hausdorff locally convex algebra topologies on subalgebras of the whole algebra of nonlinear generalized functions. These topologies are strong duals of Fr\'echet-Schwartz space topologies and even strong duals of…
We extend results from an earlier paper giving reconstruction results for the endomorphism monoid of the rational numbers under the strict and reflexive relations to the first order reducts of the rationals and the corresponding…
A set of valuable universal similarity factorization equalities are established over complex Clifford algebras $\Cn.$ Through them matrix representations of complex Clifford algebras $\Cn$ can directly be derived, and their properties can…
We show that the basic categorical concept of an S-algebra as derived from the theory of Segal's Gamma-sets provides a unifying description of several constructions attempting to model an algebraic geometry over the absolute point. It…
Semigroup theory is a branch of abstract algebra, and it provides mathematical tools for the theory of computation. Finite semigroups can describe state transition systems and thus they model physically realizable computers. Engineering…
Let $\mathcal{C}\subseteq \mathbb{N}^p$ be an integer cone. A $\mathcal{C}$-semigroup $S\subseteq \mathcal{C}$ is an affine semigroup such that the set $\mathcal{C}\setminus S$ is finite. Such $\mathcal{C}$-semigroups are central to our…