Unions of admissible relations
Abstract
We show that a variety is congruence distributive if and only if there is some such that the inclusion (1) ( factors) holds in every algebra in , for every tolerance and every U-admissible relation . By a U-admissible relation we mean a binary relation which is the set-theoretical union of a set of reflexive and admissible relations. For any fixed , a Maltsev-type characterization is given for the inclusion (1). It is an open problem whether (1) is still equivalent to congruence distributivity when is assumed to be a -admissible relation, rather than a tolerance. In both cases many equivalent formulations for (1) are presented. The results suggest that it might be interesting to study the structure of the set of U-admissible relations on an algebra, as well as identities dealing with such relations.
Keywords
Cite
@article{arxiv.1704.02476,
title = {Unions of admissible relations},
author = {Paolo Lipparini},
journal= {arXiv preprint arXiv:1704.02476},
year = {2018}
}
Comments
v.3, some improvements