Submaximal clones over a three-element set up to minor-equivalence
From MaRDI portal
Publication:6203757
DOI10.1007/S00012-024-00852-WarXiv2304.12807OpenAlexW4392925261MaRDI QIDQ6203757FDOQ6203757
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 , also known as minor identities, and therefore share many algebraic properties. Moreover, it was proved that the complexity of the of a finite structure only depends on the set of minor identities satisfied by the polymorphism clone of . In this article we consider the poset that arises by considering all clones over a three-element set with the following order: we write if there exists a minor homomorphism from to . We show that the aforementioned poset has only three submaximal elements.
Full work available at URL: https://arxiv.org/abs/2304.12807
Many-valued logic (03B50) Equational logic, Mal'tsev conditions (08B05) Applications of universal algebra in computer science (08A70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Clones of algebras with parallelogram terms
- The structure of finite algebras
- Polynomial interpolation and the Chinese remainder theorem for algebraic systems
- The cardinality of the set of all clones containing a given minimal clone on three elements
- Closed systems of functions and predicates
- The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
- On the number of finite Mal'tsev algebras
- Taylor's modularity conjecture and related problems for idempotent varieties
- Key (critical) relations preserved by a weak near-unanimity function
- On algebras with many symmetric operations
- The wonderland of reflections
- Algebraic Approach to Promise Constraint Satisfaction
- Two-element structures modulo primitive positive constructability
- Finite degree clones are undecidable
- Smooth digraphs modulo primitive positive constructability and cyclic loop conditions
- The lattice of clones of self-dual operations collapsed
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)