Loop conditions for strongly connected digraphs

Abstract

We prove that every strongly connected (not necessarily finite) digraph of algebraic length 1, which is compatible with an operation t satisfying a non-trivial identity of the form t(...) approximate to t(...), has a loop.

Keywords

• Maltsev conditions
• loop conditions
• Siggers term