Metraipolis › archive › dc_7fe33074d202

Finitely Related Clones: Action Algebras and Applications to Free Algebras — arXiv:2608.17762

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.17762
License (as archived)
CC0-1.0
Archived
2026-10-18T15:16:31.964Z
SHA-256 of the archived text
2aeb6a74ef7c386ad53ebfb37424e152526808a999fdda14211f74d298307e1d
Stable URL of this page
https://metraipolis.com/documento/dc_7fe33074d202

How to cite

Finitely Related Clones: Action Algebras and Applications to Free Algebras — arXiv:2608.17762 — arXiv (en), https://arxiv.org/abs/2608.17762 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7fe33074d202 (Metraipolis archive dc_7fe33074d202, sha256 2aeb6a74ef7c386ad53ebfb37424e152526808a999fdda14211f74d298307e1d)
BibTeX
@misc{dc7fe33074d202,
  title = {Finitely Related Clones: Action Algebras and Applications to Free Algebras — arXiv:2608.17762},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.17762},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7fe33074d202; sha256 2aeb6a74ef7c386ad53ebfb37424e152526808a999fdda14211f74d298307e1d},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.17762. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

For finite-domain constraint satisfaction problems (CSPs), the polymorphism clone provides an algebraic framework for studying the associated constraint language. A central question in clone theory is whether a clone is finitely related, that is, whether it is determined by the operations preserving a finite set of relations. Here, we study this question through the action algebra of a clone on its own $n$-ary part. We prove that a clone $\mathcal{C}$ on a finite domain $C$ is finitely related if and only if its action algebra $\widetilde{\mathcal{C}} = \mathcal{C} \curvearrowright \mathcal{C}^{(n)}$ is finitely related, provided that $n \geq |C|$. We also apply natural clone isomorphisms to obtain a finite-relatedness criterion for free algebras: a finite algebra is finitely related if and only if its free algebra of sufficiently large finite rank is finitely related.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-19 in math.LO).
Categorie arXiv: Logic (math.LO).
Pagina del lavoro: https://arxiv.org/abs/2608.17762 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T15:10:42.771Z dalla pagina https://arxiv.org/catchup/math.LO/2026-08-19?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).