Loop conditions
classification
🧮 math.LO
math.CO
keywords
conditionsloopconditionassignedcallclassificationconsistdiscuss
read the original abstract
We discuss such Maltsev conditions that consist of just one linear equation, we call them loop conditions. To every such condition can be assigned a graph. We provide a classification of conditions with undirected graphs. It follows that the Siggers term is the weakest non-trivial loop condition.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.