Pseudo‐loop conditions

DOI10.1112/BLMS.12286zbMATH Open1444.08003arXiv1812.00396OpenAlexW3100236156WikidataQ89687152 ScholiaQ89687152MaRDI QIDQ5205451FDOQ5205451

Authors: Pierre Gillibert, Michael Pinsker, J. Jonušas 

Publication date: 11 December 2019

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

Abstract: We initiate the systematic study of loop conditions of arbitrary finite width. Each loop condition is a finite set of identities of a particular shape, and satisfaction of these identities in an algebra is characterized by it forcing a constant tuple into certain invariant relations on powers of the algebra. By showing the equivalence of various loop conditions, we are able to provide a new and short proof of the recent celebrated result stating the existence of a weakest non-trivial idempotent strong Mal'cev condition. We then consider pseudo-loop conditions, a modification suitable for oligomorphic algebras, and show the equivalence of various pseudo-loop conditions within this context. This allows us to provide a new and short proof of the fact that the satisfaction of non-trivial identities of height 1 in a closed oligomorphic core implies the satisfaction of a fixed single identity.

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

Recommendations

• Loop conditions
• scientific article; zbMATH DE number 15514
• scientific article; zbMATH DE number 1457382
• scientific article; zbMATH DE number 2090530
• scientific article; zbMATH DE number 1972793
• Constraint preservation through loops
• scientific article; zbMATH DE number 5166751
• A necessary and sufficient condition for a loop to be a po-loop
• scientific article; zbMATH DE number 742843

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Existence theorems for weakly symmetric operations
• Title not available (Why is that?)
• The structure of finite algebras
• Finitely related algebras in congruence distributive varieties have near unanimity terms
• Algebras Whose Congruence Lattices are Distributive.
• Title not available (Why is that?)
• \(H\)-coloring dichotomy revisited
• 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
• Maltsev conditions for general congruence meet-semidistributive algebras
• A strong Mal'cev condition for locally finite varieties omitting the unary type
• Reducts of Ramsey structures
• Congruence modularity is permutability composed with distributivity
• Varieties Obeying Homotopy Laws
• The algebraic dichotomy conjecture for infinite domain constraint satisfaction problems
• A universal-algebraic proof of the complexity dichotomy for monotone monadic SNP
• PROJECTIVE CLONE HOMOMORPHISMS
• Finitely related algebras in congruence modular varieties have few subpowers
• The wonderland of reflections
• The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems
• Taylor term does not imply any nontrivial linear one-equality Maltsev condition
• The weakest nontrivial idempotent equations
• Algebraic approach to promise constraint satisfaction
• Constraint satisfaction problems for reducts of homogeneous graphs
• Equations in oligomorphic clones and the constraint satisfaction problem for \(\omega \)-categorical structures
• Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems)

Cited In (4)

• Local–global property for G-invariant terms
• The weakest nontrivial idempotent equations
• Collapsing the bounded width hierarchy for infinite-domain constraint satisfaction problems: when symmetries are enough
• The local loop lemma

This page was built for publication: Pseudo‐loop conditions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5205451)