Surjective polymorphisms of directed reflexive cycles

DOI10.1007/s00012-023-00834-4zbMath1529.05093arXiv2206.11390MaRDI QIDQ6183437

Benoit Larose, Isabelle Larivière, David E. Pazmiño Pullas

Publication date: 4 January 2024

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

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

zbMATH Keywords

constraint satisfaction problemsreflexive digraphsgeneralized distancesSłupeckisurjective polymorphisms

Mathematics Subject Classification ID

Combinatorics on words (68R15) Paths and cycles (05C38) Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Reflexive digraphs with near unanimity polymorphisms
• The complexity of constraint satisfaction games and QCSP
• Algebraic properties of crowns and fences
• The clone of operations preserving a cycle with loops
• A discrete homotopy theory for binary reflexive structures
• Two new homomorphism dualities and lattice operations
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• Algebra and the Complexity of Digraph CSPs: a Survey
• Quantified Constraints in Twenty Seventeen
• Function Algebras on Finite Sets
• QCSP on Reflexive Tournaments

This page was built for publication: Surjective polymorphisms of directed reflexive cycles