Finitely related algebras in congruence distributive varieties have near unanimity terms

DOI10.4153/CJM-2011-087-3MaRDI QIDQ4907620zbMATH OpenFDO

Authors Libor Barto

Publication date 4 February 2013

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

constraint satisfaction problemrelational structurecongruence distributive varietyfinitely related algebranear unanimity operationJonsson operations

Mathematics Subject Classification ID

Relational systems, laws of composition (08A02) Equational logic, Mal'tsev conditions (08B05) Congruence modularity, congruence distributivity (08B10)

Recommendations

• The existence of a near-unanimity term in a finite algebra is decidable
• scientific article; zbMATH DE number 3787
• On the (un)decidability of a near-unanimity term
• Near unanimity: An obstacle to general duality theory
• scientific article; zbMATH DE number 4045812

Cited in

(35)

• Quasiorder lattices of varieties
• \(n\)-permutability and linear Datalog implies symmetric Datalog
• Tractability in constraint satisfaction problems: a survey
• Relations compatible with near unanimity operations
• Congruence distributivity implies bounded width
• scientific article; zbMATH DE number 4045812 (Why is no real title available?)
• Absorption in universal algebra and CSP
• Between an n-ary and an n + 1-ary near-unanimity term
• The existence of a near-unanimity term in a finite algebra is decidable
• Menger systems of idempotent cyclic and weak near-unanimity multiplace functions
• Robust algorithms with polynomial loss for near-unanimity CSPs
• The lattice of clones of self-dual operations collapsed
• Cube term blockers without finiteness
• Decidability of absorption in relational structures of bounded width.
• Absorption and directed Jónsson terms
• scientific article; zbMATH DE number 7359806 (Why is no real title available?)
• Approximate distributive laws and finite equational bases for finite algebras in congruence-distributive varieties
• On the number of finite algebraic structures
• Finite degree: algebras in general and semigroups in particular
• Pseudo‐loop conditions
• On tractability and congruence distributivity
• Existence of cube terms in finite algebras
• Mitschke's theorem is sharp
• Dualities and algebras with a near-unanimity term
• On finitely related semigroups.
• Few subpowers, congruence distributivity and near-unanimity terms
• Preserving near unanimity terms under products
• The structure of polynomial operations associated with smooth digraphs.
• Finite degree clones are undecidable
• The existence of a near-unanimity function is decidable
• Binarisation for valued constraint satisfaction problems
• Not all nilpotent monoids are finitely related
• Deciding absorption in relational structures
• When symmetries are not enough: a hierarchy of hard constraint satisfaction problems
• The smallest hard trees

This page was built for publication: Finitely related algebras in congruence distributive varieties have near unanimity terms

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