Day's Theorem is sharp for n even
Abstract
We solve some problems about relative lengths of Maltsev conditions, in particular, we give an affirmative answer to a classical problem raised by A. Day more than fifty 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\'onsson terms t0, …, tn witnessing congruence distributivity it is possible to construct terms u0, …, u 2n-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, Pixley, directed, specular, mixed and defective. All the results hold when restricted to locally finite varieties. We introduce some families of congruence distributive varieties and characterize many congruence identities they satisfy.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.