Abstract.In this paper, we describe all equational theories of commutative semigroups in terms of certain well-quasi-orderings on the set of finite sequences of nonnegative integers. This description yields many old and new results on varieties of commutative semigroups. In particular, we obtain also a description of the lattice of varieties of commutative semigroups, and we give an explicit uniform solution to the word problems for free objects in all varieties of commutative semigroups.
Abstract. A clone C on a set A is a set of operations on A containing the projection operations and closed under composition. A combinatorial invariant of a clone is its /^-sequence {pn{C), px(C), ...), where pn{C) is the number of essentially n-ary operations in C. We investigate the links between this invariant and structural properties of clones. It has been conjectured that the pn -sequence of a clone on a finite set is either eventually strictly increasing or is bounded above by a finite constant. We verify this conjecture for a large family of clones. A special role in our work is played by totally symmetric operations and totally symmetric clones. We show that every totally symmetric clone on a finite set has a bounded pn -sequence and that it is decidable if a clone is totally symmetric.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.