Characterizations of several Maltsev conditions.

DOI10.1007/s00012-015-0327-2zbMath1319.08002OpenAlexW2053204108MaRDI QIDQ2351504

Marcin Kozik, Matthew A. Valeriote, Ross Willard, Andrei A. Krokhin

Publication date: 23 June 2015

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

Full work available at URL: http://dro.dur.ac.uk/21179/1/21179.pdf

zbMATH Keywords

locally finite varietiesMaltsev conditions

Mathematics Subject Classification ID

Applications of universal algebra in computer science (08A70) Equational logic, Mal'tsev conditions (08B05) Congruence modularity, congruence distributivity (08B10)

Related Items (27)

Tractability in constraint satisfaction problems: a survey ⋮ Sherali-Adams Relaxations for Valued CSPs ⋮ CSP for binary conservative relational structures ⋮ Optimal strong Mal'cev conditions for congruence meet-semidistributivity in locally finite varieties ⋮ Congruence meet-semidistributive locally finite varieties and a finite basis theorem ⋮ Towards a characterization of constant-factor approximable finite-valued CSPs ⋮ The Power of Sherali--Adams Relaxations for General-Valued CSPs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The smallest hard trees ⋮ Universal algebraic methods for non-classical logics ⋮ Equations implying congruence \(n\)-permutability and semidistributivity. ⋮ The Complexity of Valued CSPs ⋮ Backdoor Sets for CSP. ⋮ Algebra and the Complexity of Digraph CSPs: a Survey ⋮ Mal'tsev conditions, lack of absorption, and solvability. ⋮ Maltsev families of varieties closed under join or Maltsev product ⋮ A characterization of idempotent strong Mal'cev conditions for congruence meet-semidistributivity in locally finite varieties ⋮ Optimal strong Mal'cev conditions for omitting type 1 in locally finite varieties. ⋮ Backdoors into heterogeneous classes of SAT and CSP ⋮ Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs ⋮ Dichotomy for finite tournaments of mixed-type ⋮ A Dichotomy for First-Order Reducts of Unary Structures ⋮ A note on the weakest Taylor term ⋮ Unnamed Item ⋮ MALTSEV CONDITIONS FOR GENERAL CONGRUENCE MEET-SEMIDISTRIBUTIVE ALGEBRAS ⋮ Commutative idempotent groupoids and the constraint satisfaction problem.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mal'tsev conditions, lack of absorption, and solvability.
• Maltsev families of varieties closed under join or Maltsev product
• A strong Mal'cev condition for locally finite varieties omitting the unary type
• Existence theorems for weakly symmetric operations
• On \(n\)-permutable congruences
• Complexity of constraints. An overview of current research themes
• Optimal strong Mal'cev conditions for omitting type 1 in locally finite varieties.
• Dualizable algebras with parallelogram terms
• The collapse of the bounded width hierarchy
• Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem
• Constraint Satisfaction Problems Solvable by Local Consistency Methods
• The lattice of interpretability types of varieties
• Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete
• 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
• The shape of congruence lattices
• Constraint Satisfaction Problems of Bounded Width
• Recent Results on the Algebraic Approach to the CSP
• Algebras Whose Congruence Lattices are Distributive.

This page was built for publication: Characterizations of several Maltsev conditions.