Existence theorems for weakly symmetric operations
From MaRDI portal
Publication:1001467
DOI10.1007/s00012-008-2122-9zbMath1186.08003OpenAlexW1988961015MaRDI QIDQ1001467
Publication date: 17 February 2009
Published in: Algebra Universalis (Search for Journal in Brave)
Full work available at URL: http://real.mtak.hu/4595/1/1116615.pdf
Equational logic, Mal'tsev conditions (08B05) Operations and polynomials in algebraic structures, primal algebras (08A40) Congruence modularity, congruence distributivity (08B10)
Related Items (58)
Naturally dualizable algebras omitting types 1 and 5 have a cube term ⋮ Hard constraint satisfaction problems have hard gaps at location 1 ⋮ Constraint Satisfaction Problems over the Integers with Successor ⋮ 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 ⋮ Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy ⋮ A strong Mal'cev condition for locally finite varieties omitting the unary type ⋮ Cyclic terms for \(\text{SD}_{\vee}\) varieties revisited ⋮ The Power of Sherali--Adams Relaxations for General-Valued CSPs ⋮ On the complexity of \(\mathbb{H}\)-coloring for special oriented trees ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The smallest hard trees ⋮ A new line of attack on the dichotomy conjecture ⋮ Binarisation for Valued Constraint Satisfaction Problems ⋮ Taylor term does not imply any nontrivial linear one-equality Maltsev condition ⋮ The Complexity of Valued CSPs ⋮ Quantified Constraints in Twenty Seventeen ⋮ Algebra and the Complexity of Digraph CSPs: a Survey ⋮ A juggler's dozen of easy\(^\dag\) problems (\(^\dag\) Well, easily formulated \dots). ⋮ Mal'tsev conditions, lack of absorption, and solvability. ⋮ On Maltsev Digraphs ⋮ A characterization of idempotent strong Mal'cev conditions for congruence meet-semidistributivity in locally finite varieties ⋮ Key (critical) relations preserved by a weak near-unanimity function ⋮ The complexity of the list homomorphism problem for graphs ⋮ On solvability of systems of polynomial equations ⋮ Embedding general algebras into modules ⋮ On Maltsev digraphs ⋮ CSP duality and trees of bounded pathwidth ⋮ The \(C_{k}\)-extended graft construction ⋮ THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRA ⋮ Optimal strong Mal'cev conditions for omitting type 1 in locally finite varieties. ⋮ Pseudo‐loop conditions ⋮ Dichotomy for finite tournaments of mixed-type ⋮ Random models of idempotent linear Maltsev conditions. I. Idemprimality ⋮ Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems) ⋮ Unnamed Item ⋮ CSP dichotomy for special triads ⋮ The existence of a near-unanimity term in a finite algebra is decidable ⋮ Unnamed Item ⋮ The number of clones determined by disjunctions of unary relations ⋮ АЛГЕБРЫ РИСА И КОНГРУЭНЦ-АЛГЕБРЫ РИСА В ОДНОМ КЛАССЕ АЛГЕБР С ОПЕРАТОРОМ И ОСНОВНОЙ ОПЕРАЦИЕЙ ПОЧТИ ЕДИНОГЛАСИЯ ⋮ АЛГЕБРЫ РИСА И КОНГРУЭНЦ-АЛГЕБРЫ РИСА В ОДНОМ КЛАССЕ АЛГЕБР С ОПЕРАТОРОМ И ОСНОВНОЙ ОПЕРАЦИЕЙ ПОЧТИ ЕДИНОГЛАСИЯ ⋮ A combinatorial constraint satisfaction problem dichotomy classification conjecture ⋮ A Dichotomy for First-Order Reducts of Unary Structures ⋮ On weak positive predicates over a finite set ⋮ Congruence modularity implies cyclic terms for finite algebras ⋮ Recent Results on the Algebraic Approach to the CSP ⋮ Dualities for Constraint Satisfaction Problems ⋮ CSP DICHOTOMY FOR SPECIAL POLYADS ⋮ Rainbow Coloring Hardness via Low Sensitivity Polymorphisms ⋮ Unnamed Item ⋮ MALTSEV CONDITIONS FOR GENERAL CONGRUENCE MEET-SEMIDISTRIBUTIVE ALGEBRAS ⋮ Between an n-ary and an n + 1-ary near-unanimity term ⋮ Characterizations of several Maltsev conditions. ⋮ Testing for edge terms is decidable ⋮ Distance constraint satisfaction problems
This page was built for publication: Existence theorems for weakly symmetric operations
