Loop conditions
Logic
2018-02-12 v2 Combinatorics
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.
Cite
@article{arxiv.1701.00260,
title = {Loop conditions},
author = {Miroslav Olšák},
journal= {arXiv preprint arXiv:1701.00260},
year = {2018}
}