On the Complexity of Some Maltsev Conditions

This paper studies the complexity of determining if a finite algebra generates a variety that satisfies various Maltsev conditions, such as congruence distributivity or modularity. For idempotent algebras we show that there are polynomial time algorithms to test for these conditions but that in general these problems are EXPTIME complete. In addition, we provide sharp bounds in terms of the size of two-generated free algebras on the number of terms needed to witness various Maltsev conditions, such as congruence distributivity.

[1]  David Hobby.  Finding Type Sets is NP-Hard , 1991, Int. J. Algebra Comput..

[2]  Alan Day,et al.  A Characterization of Identities Implying Congruence Modularity I , 1980, Canadian Journal of Mathematics.

[3]  Giora Slutzki,et al.  Computational Complexity of Term-Equivalence , 1999, Int. J. Algebra Comput..

[4]  B. Jonnson.  Algebras Whose Congruence Lattices are Distributive. , 1967 .

[5]  M. Valeriote.  A Subalgebra Intersection Property for Congruence Distributive Varieties , 2009, Canadian Journal of Mathematics.

[6]  Keith A. Kearnes.  Congruence Permutable and Congruence 3-Permutable Locally Finite Varieties , 1993 .

[7]  Keith A. Kearnes,et al.  MODULARITY PREVENTS TAILS , 1996, math/9609219.

[8]  Anna B. Romanowska,et al.  Universal algebra and quasigroup theory , 1992 .

[9]  R. McKenzie,et al.  Commutator theory for congruence modular varieties , 1989 .

[10]  H. Peter Gumm.  Congruence modularity is permutability composed with distributivity , 1981 .

[11]  Bradd Hart,et al.  Lectures on algebraic model theory , 2001 .

[12]  Ralph McKenzie,et al.  Tarski's Finite Basis Problem is Undecidable , 1996, Int. J. Algebra Comput..

[13]  D. Hobby,et al.  The structure of finite algebras , 1988 .

[14]  Ralph Freese,et al.  Computing congruences efficiently , 2008 .

[15]  Dexter Kozen,et al.  Lower bounds for natural proof systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[16]  James B. Nation.  Varieties whose congruences satisfy cerain lattice identities , 1974 .

[17]  Kazimierz Urbanik.  On algebraic operations in idempotent algebras , 1964 .

[18]  Stanley Burris,et al.  A course in universal algebra , 1981, Graduate texts in mathematics.

[19]  Ross Willard,et al.  A characterization of congruence permutable locally finite varieties , 1991 .

[20]  Keith A. Kearnes,et al.  A modification of Polin’s variety , 1999 .

[21]  James B. Nation,et al.  Problems and Results in Tame Congruence Theory a Survey of the '88 Budapest Workshop , 1992 .

[22]  R. McKenzie,et al.  Algebras, Lattices, Varieties , 1988 .

[23]  Klaus Denecke,et al.  Tame Congruence Theory , 2018, Universal Algebra and Applications in Theoretical Computer Science.

[24]  Alan Day,et al.  A Characterization of Modularity for Congruence Lattices of Algebras* , 1969, Canadian Mathematical Bulletin.

[25]  Keith A. Kearnes,et al.  The Relationship Between Two Commutators , 1998, Int. J. Algebra Comput..