[Paper Review] Loop conditions with strongly connected graphs

Miroslav Olšák|arXiv (Cornell University)|Oct 7, 2018

Advanced Graph Theory Research9 references4 citations

TL;DR

This paper establishes that the existence of a term satisfying $ s(r,a,r,e) = s(a,r,e,a) $ in an algebra is equivalent to the existence of a term satisfying $ t(x,x,y,y,z,z) = t(y,z,z,x,x,y) $, proving that all loop conditions defined by strongly connected digraphs of algebraic length one are equivalent. The key contribution is a structural characterization: a variety satisfies a non-trivial loop condition if and only if every compatible graph with a strongly connected component of algebraic length one contains a loop.

ABSTRACT

We prove that the existence of a term $s$ satisfying $s(r,a,r,e) = s(a,r,e,a)$ in a general algebraic structure is equivalent to an existence of a term $t$ satisfying $t(x,x,y,y,z,z)=t(y,z,z,x,x,y)$. As a consequence of a general version of this theorem and previous results we get that each strongly connected digraph of algebraic length one, which is compatible with an operation $t$ satisfying an identity of the from $t(\ldots)=t(\ldots)$, has a loop.

Motivation & Objective

• To resolve the open question of whether the 4-ary and 6-ary Siggers loop conditions are equivalent in general algebras.
• To generalize the loop lemma to arbitrary algebras by identifying a broader class of equivalent loop conditions.
• To provide a structural characterization of varieties satisfying non-trivial loop conditions using graph-theoretic properties of compatible graphs.
• To unify and extend previous results on Taylor terms, Siggers terms, and loop conditions in universal algebra and constraint satisfaction.

Proposed method

• Introduces a digraph associated with each loop condition, where vertices represent variables and edges represent variable dependencies in the term identity.
• Defines algebraic length of a digraph as the gcd of the lengths of all directed cycles, with algebraic length one indicating that no nontrivial cycle can be mapped to a directed cycle.
• Uses primitive positive (pp) definitions to construct new digraphs from existing ones, preserving algebraic length and enabling inductive reduction of cycles.
• Applies induction on cycle length to prove that any strongly connected digraph of algebraic length one satisfying a loop condition must imply a loop in the underlying algebra.
• Leverages known results from universal algebra, including the existence of Taylor terms and Siggers terms, to establish equivalence between different loop conditions.
• Employs the concept of graph compatibility with algebras: a graph is compatible if its edges are preserved under all term operations of the algebra.

Experimental results

Research questions

• RQ1 Are the 4-ary Siggers loop condition $ s(r,a,r,e) = s(a,r,e,a) $ and the 6-ary Siggers loop condition $ t(x,x,y,y,z,z) = t(y,z,z,x,x,y) $ equivalent in general (infinite) algebras?
• RQ2 What structural condition on a graph compatible with an algebra guarantees the existence of a loop, given that the algebra satisfies a non-trivial loop condition?
• RQ3 Can all loop conditions defined by strongly connected digraphs of algebraic length one be shown to be equivalent?
• RQ4 Does the existence of a 4-ary near unanimity term imply a loop condition that is not equivalent to the $ \mathbb{K}_3 $ loop condition?
• RQ5 What is the full hierarchy of loop conditions when restricted to strongly connected digraphs of arbitrary algebraic length?

Key findings

• The existence of a term satisfying $ s(r,a,r,e) = s(a,r,e,a) $ is equivalent to the existence of a term satisfying $ t(x,x,y,y,z,z) = t(y,z,z,x,x,y) $, resolving the open question of equivalence between these two loop conditions.
• Every variety satisfying a non-trivial loop condition contains a 4-ary Siggers term satisfying $ s(r,a,r,e) = s(a,r,e,a) $, and vice versa.
• A variety satisfies a non-trivial loop condition if and only if every compatible graph with a strongly connected component of algebraic length one contains a loop.
• The loop lemma for digraphs with algebraic length one generalizes to all algebras, not just finite ones, extending previous results from finite algebras to the general case.
• The class of loop conditions defined by strongly connected digraphs of algebraic length one forms a single equivalence class under the framework of primitive positive interpretations.
• The paper provides a counterexample showing that the 4-ary near unanimity term does not imply any loop condition beyond the $ \mathbb{K}_3 $ condition, leaving the question open for further investigation.