Clones containing the Mal'cev operation of $\mathbb{Z}_{pq}$
Stefano Fioravanti

TL;DR
This paper studies the structure of clones containing addition on the set b{Z}_{pq} for distinct primes p and q, showing the lattice of such clones is finite and providing bounds on its size.
Contribution
It establishes the finiteness of the clone lattice on b{Z}_{pq} containing addition and provides an explicit upper bound for its cardinality.
Findings
The lattice of clones containing addition on b{Z}_{pq} is finite.
An upper bound for the lattice's size is given via injective functions to product lattices.
These clones can be generated by functions of arity at most b{max}(p,q).
Abstract
We investigate finitary functions from to for two distinct prime numbers and . We show that the lattice of all clones on the set which contain the addition of is finite. We provide an upper bound for the cardinality of this lattice through an injective function to the direct product of the lattice of all -linearly closed clonoids to the power and the lattice of all -linearly closed clonoids to the power. These lattices are studied in arXiv:1910.11759 and there we can find the exact cardinality of them. Furthermore, we prove that these clones can be generated by a set of functions of arity at most .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · semigroups and automata theory · Algebraic Geometry and Number Theory
