Polynomial clones on squarefree groups

Peter Mayr

Research output: Contribution to journalArticlepeer-review

Abstract

We prove that, on a set of size n, the number of clones that contain a group operation and all constant functions is finite if n is squarefree. This confirms a conjecture by Pawe l Idziak from [5] where the converse implication was shown. Our result follows from the observation that the polynomial clone of an expansion of a squarefree group is uniquely determined by its binary functions. We also note that, in general, such a clone is not determined by the congruence lattice and the commutator operation of the corresponding algebra. This refutes a second conjecture from [5].
Original languageEnglish
Pages (from-to)759 - 777
Number of pages19
JournalInternational Journal of Algebra and Computation
Volume18
Issue number4
DOIs
Publication statusPublished - Jun 2008

Fields of science

  • 101 Mathematics
  • 101001 Algebra
  • 101005 Computer algebra
  • 101013 Mathematical logic
  • 102031 Theoretical computer science

Cite this