Abstract
AbstractWe solve some problems about relative lengths of Maltsev conditions, in particular, we provide an affirmative answer to a classical problem raised by A. Day more than 50 years ago. In detail, both congruence distributive and congruence modular varieties admit Maltsev characterizations by means of the existence of a finite but variable number of appropriate terms. A. Day showed that from Jónsson terms $$t_0,\ldots , t_n$$
t
0
,
…
,
t
n
witnessing congruence distributivity it is possible to construct terms $$u_0,\ldots , u _{2n-1} $$
u
0
,
…
,
u
2
n
-
1
witnessing congruence modularity. We show that Day’s result about the number of such terms is sharp when n is even. We also deal with other kinds of terms, such as alvin, Gumm, directed, as well as with possible variations we will call “specular” and “defective”. All the results hold when restricted to locally finite varieties.
Funder
Università degli Studi di Roma Tor Vergata
Publisher
Springer Science and Business Media LLC
Reference27 articles.
1. Baker, K.A.: Congruence-distributive polynomial reducts of lattices. Algebra Universalis 9, 142–145 (1979)
2. Research and Exposition in Mathematics;I Chajda,2007
3. Chicco, A.: Prime Maltsev conditions and congruence $$n$$-permutability. PhD Thesis, McMaster University, Hamilton, Ontario (2018)
4. Cornish, W.H.: A ternary variety generated by lattices. Comment. Math. Univ. Carol. 22, 773–784 (1981)
5. Day, A.: A characterization of modularity for congruence lattices of algebras. Can. Math. Bull. 12, 167–173 (1969)