The local loop lemma

DOI10.1007/S00012-020-0644-YMaRDI QIDQ2302149zbMATH OpenOpenAlexWikidataFDO

Authors Miroslav Olšák

Publication date 25 February 2020

Published in Algebra Universalis (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

digraphlocal loop lemmaTaylor algebra

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Equational logic, Mal'tsev conditions (08B05) Free algebras (08B20)

Abstract: We prove that an idempotent operation generates a loop from a strongly connected digraph containing directed cycles of all lengths under very mild (local) algebraic assumptions. Using the result, we reprove the existence of a weakest non-trivial idempotent equations, and that a strongly connected digraph with algebraic length 1 compatible with a Taylor term has a loop.

Recommendations

• scientific article; zbMATH DE number 1556643
• scientific article; zbMATH DE number 2070257
• Publication:3473887
• scientific article; zbMATH DE number 1103394
• The local cut lemma
• scientific article; zbMATH DE number 1377860
• Extension of local loop isomorphisms
• Local loop near-rings
• Publication:4206946
• Revisit the Lovász local lemma

Cites work

• scientific article; zbMATH DE number 7359806 (Why is no real title available?)
• Absorbing subalgebras, cyclic terms, and the constraint satisfaction problem
• Loop conditions
• On the complexity of H-coloring
• Optimal strong Mal'cev conditions for omitting type 1 in locally finite varieties.
• Pseudo‐loop conditions
• The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
• The algebraic dichotomy conjecture for infinite domain constraint satisfaction problems
• The weakest nontrivial idempotent equations
• Universal algebra. Fundamentals and selected topics
• \(H\)-coloring dichotomy revisited

Cited in

(2)

• Smooth digraphs modulo primitive positive constructability and cyclic loop conditions
• The structure of polynomial operations associated with smooth digraphs.

This page was built for publication: The local loop lemma

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