Dualities and algebras with a near-unanimity term
From MaRDI portal
Publication:312213
DOI10.1007/s00012-016-0388-xzbMath1366.08002OpenAlexW2496730161MaRDI QIDQ312213
Udom Chotwattakawanit, Ratana Srithus
Publication date: 14 September 2016
Published in: Algebra Universalis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00012-016-0388-x
Subalgebras, congruence relations (08A30) Automorphisms and endomorphisms of algebraic structures (08A35) Natural dualities for classes of algebras (08C20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maltsev digraphs have a majority polymorphism
- Monotone clones and the varieties they determine
- \(H\)-coloring dichotomy revisited
- Algebraic properties of crowns and fences
- Chromatically optimal rigid graphs
- Exponents of lattice-ordered algebras
- Constraints, consistency and closure
- Constraints and universal algebra
- A maximal clone of monotone operations which is not finitely generated
- Monotone Jónsson operations and near unanimity functions
- Near unanimity: An obstacle to general duality theory
- On digraph coloring problems and treewidth duality
- The existence of a near-unanimity function is decidable
- On constantive simple and order-primal algebras
- Optimal Natural Dualities
- Posets, near unanimity functions and zigzags
- Relational Sets and Categorical Equivalence of Algebras
- The Complexity of the Extendibility Problem for Finite Posets
- Classifying the Complexity of Constraints Using Finite Algebras
- Tractability and Learnability Arising from Algebras with Few Subpowers
- Order varieties and monotone retractions of finite posets
This page was built for publication: Dualities and algebras with a near-unanimity term
