Submaximal clones over a three-element set up to minor-equivalence

From MaRDI portal
Publication:6203757

DOI10.1007/S00012-024-00852-WarXiv2304.12807OpenAlexW4392925261MaRDI QIDQ6203757FDOQ6203757

Albert Vucaj, D. N. Zhuk

Publication date: 8 April 2024

Published in: Algebra Universalis (Search for Journal in Brave)

Abstract: We study clones modulo minor homomorphisms, which are mappings from one clone to another preserving arities of operations and respecting permutation and identification of variables. Minor-equivalent clones satisfy the same sets of identities of the form f(x1,dots,xn)approxg(y1,dots,ym), also known as minor identities, and therefore share many algebraic properties. Moreover, it was proved that the complexity of the operatornameCSP of a finite structure mathbbA only depends on the set of minor identities satisfied by the polymorphism clone of mathbbA. In this article we consider the poset that arises by considering all clones over a three-element set with the following order: we write mathcalCpreceqmathrmmmathcalD if there exists a minor homomorphism from mathcalC to mathcalD. We show that the aforementioned poset has only three submaximal elements.


Full work available at URL: https://arxiv.org/abs/2304.12807





Cites Work


Cited In (1)






This page was built for publication: Submaximal clones over a three-element set up to minor-equivalence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6203757)