Skip to main content
Log in

Generating primitive positive clones

  • Published:
algebra universalis Aims and scope Submit manuscript

Abstract.

Suppose \( \cal F \) is a set of operations on a finite set A. Define PPC(\(\cal F \)) to be the smallest primitive positive clone on A containing \( \cal F \). For any finite algebra A, let PPC#(A) be the smallest number n for which PPC(CloA) = PPC(Clo n A). S. Burris and R. Willard [2] conjectured that PPC#(A) ≤|A| when CloA is a primitive positive clone and |A| > 2. In this paper, we look at how large PPC#(A) can be when special conditions are placed on the finite algebra A. We show that PPC#(A) ≤|A| holds when the variety generated by A is congruence distributive, Abelian, or decidable. We also show that PPC#(A) ≤|A| + 2 if A generates a congruence permutable variety and every subalgebra of A is the product of a congruence neutral algebra and an Abelian algebra. Furthermore, we give an example in which PPC#(A) ≥|A| - 1)2 so that these results are not vacuous.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received August 30, 1999; accepted in final form April 4, 2000.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Snow, J. Generating primitive positive clones. Algebra univers. 44, 169–185 (2000). https://doi.org/10.1007/s000120050179

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s000120050179

Navigation