Pseudo‐loop conditions

DOI10.1112/blms.12286zbMath1444.08003arXiv1812.00396OpenAlexW3100236156WikidataQ89687152 ScholiaQ89687152MaRDI QIDQ5205451

Michael Pinsker, Pierre Gillibert, Julius Jonušas

Publication date: 11 December 2019

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

universal algebraloop conditiongroup latticeMal'cev's identitiespseudo-loopSiggers identity

Mathematics Subject Classification ID

Equational logic, Mal'tsev conditions (08B05) Equational classes, universal algebra in model theory (03C05) Automorphisms and endomorphisms of algebraic structures (08A35) Interpolation, preservation, definability (03C40)

Related Items

Local–global property for G-invariant terms ⋮ The local loop lemma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A strong Mal'cev condition for locally finite varieties omitting the unary type
• \(H\)-coloring dichotomy revisited
• Existence theorems for weakly symmetric operations
• Congruence modularity is permutability composed with distributivity
• Finitely related algebras in congruence modular varieties have few subpowers
• The wonderland of reflections
• Taylor term does not imply any nontrivial linear one-equality Maltsev condition
• Minimal functions on the random graph
• Optimal strong Mal'cev conditions for omitting type 1 in locally finite varieties.
• Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem
• Reducts of Ramsey structures
• The structure of finite algebras
• Varieties Obeying Homotopy Laws
• The weakest nontrivial idempotent equations
• The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems
• Finitely Related Algebras In Congruence Distributive Varieties Have Near Unanimity Terms
• Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures
• PROJECTIVE CLONE HOMOMORPHISMS
• MALTSEV CONDITIONS FOR GENERAL CONGRUENCE MEET-SEMIDISTRIBUTIVE ALGEBRAS
• A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP
• Algebraic approach to promise constraint satisfaction
• Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems)
• Constraint Satisfaction Problems for Reducts of Homogeneous Graphs
• Algebras Whose Congruence Lattices are Distributive.