Near-Unanimity Polymorphisms on Structures with Finite Duality

DOI10.1137/080731177MaRDI QIDQ3094924zbMATH OpenOpenAlexFDO

Authors Cynthia Loten, Claude Tardif

Publication date 27 October 2011

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/080731177

zbMATH Keywords

constraint satisfaction problemsfinite dualitynear-unanimity function

Mathematics Subject Classification ID

Trees (05C05) Descriptive complexity and finite models (68Q19)

Recommendations

• Dualities and algebras with a near-unanimity term
• Majority functions on structures with finite duality
• Reflexive graphs with near unanimity but no semilattice polymorphisms
• Reflexive digraphs with near unanimity polymorphisms
• Near-Unanimity Functions and Varieties of Reflexive Graphs
• scientific article; zbMATH DE number 3787
• scientific article; zbMATH DE number 517052
• Weak near-unanimity functions and digraph homomorphism problems
• The existence of a near-unanimity term in a finite algebra is decidable
• Clones, order varieties, near unanimity functions and holes

Cited in

(4)

• Jónsson terms and near-unanimity functions in finite posets
• Weak near-unanimity functions and digraph homomorphism problems
• Reflexive digraphs with near unanimity polymorphisms
• NU polymorphisms on reflexive digraphs

This page was built for publication: Near-Unanimity Polymorphisms on Structures with Finite Duality

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