A strong Mal'cev condition for locally finite varieties omitting the unary type

DOI10.1007/s00012-010-0082-3zbMath1216.08002OpenAlexW2035932556MaRDI QIDQ616117

Mark H. Siggers

Publication date: 7 January 2011

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

Full work available at URL: https://doi.org/10.1007/s00012-010-0082-3

zbMATH Keywords

Mal'tsev conditionomitting type 1Taylor operation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of universal algebra in computer science (08A70) Equational logic, Mal'tsev conditions (08B05) Finitary algebras (08A62)

Related Items

In praise of homomorphisms ⋮ When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems ⋮ Optimal strong Mal'cev conditions for congruence meet-semidistributivity in locally finite varieties ⋮ A complexity dichotomy for signed \(\mathbf{H}\)-colouring ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The smallest hard trees ⋮ Universal algebraic methods for non-classical logics ⋮ The wonderland of reflections ⋮ Taylor term does not imply any nontrivial linear one-equality Maltsev condition ⋮ The Complexity of Valued CSPs ⋮ 𝜔-categorical structures avoiding height 1 identities ⋮ The structure of polynomial operations associated with smooth digraphs. ⋮ A juggler's dozen of easy\(^\dag\) problems (\(^\dag\) Well, easily formulated \dots). ⋮ A characterization of idempotent strong Mal'cev conditions for congruence meet-semidistributivity in locally finite varieties ⋮ Solving equation systems in ω-categorical algebras ⋮ On solvability of systems of polynomial equations ⋮ THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRA ⋮ Loop conditions ⋮ Optimal strong Mal'cev conditions for omitting type 1 in locally finite varieties. ⋮ Pseudo‐loop conditions ⋮ Loop conditions for strongly connected digraphs ⋮ Random models of idempotent linear Maltsev conditions. I. Idemprimality ⋮ Galois connections for patterns: an algebra of labelled graphs ⋮ Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems) ⋮ Unnamed Item ⋮ Testing the Complexity of a Valued CSP Language ⋮ Unnamed Item ⋮ A combinatorial constraint satisfaction problem dichotomy classification conjecture ⋮ A Dichotomy for First-Order Reducts of Unary Structures ⋮ PROJECTIVE CLONE HOMOMORPHISMS ⋮ A note on the weakest Taylor term ⋮ Unnamed Item ⋮ The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom ⋮ Characterizations of several Maltsev conditions. ⋮ A quasi-Mal'cev condition with unexpected application.

Cites Work

• Unnamed Item
• \(H\)-coloring dichotomy revisited
• Existence theorems for weakly symmetric operations
• A combinatorial constraint satisfaction problem dichotomy classification conjecture
• On the complexity of H-coloring
• On the algebraic structure of combinatorial problems
• Varieties with few subalgebras of powers
• The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
• The structure of finite algebras
• Varieties Obeying Homotopy Laws
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• Classifying the Complexity of Constraints Using Finite Algebras
• Principles and Practice of Constraint Programming – CP 2003