Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS
   
Mobile Device Pairing
Green Open Access
Proceedings of the American Mathematical Society
Proceedings of the American Mathematical Society
ISSN 1088-6826(online) ISSN 0002-9939(print)

 

On the number of operations in a clone


Authors: Joel Berman and Andrzej Kisielewicz
Journal: Proc. Amer. Math. Soc. 122 (1994), 359-369
MSC: Primary 08A40
MathSciNet review: 1198450
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

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 $ {p_n}$-sequence $ \langle {p_0}(C),{p_1}(C), \ldots \rangle $, where $ {p_n}(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 $ {p_n}$-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 $ {p_n}$-sequence and that it is decidable if a clone is totally symmetric.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC: 08A40

Retrieve articles in all journals with MSC: 08A40


Additional Information

DOI: http://dx.doi.org/10.1090/S0002-9939-1994-1198450-9
PII: S 0002-9939(1994)1198450-9
Article copyright: © Copyright 1994 American Mathematical Society