arXiv · 1611.06574
Meet-reducible submaximal clones determined by nontrivial equivalence relations
Abstract
The structure of the lattice of clones on a finite set has been proven to be very complex. To better understand the top of this lattice, it is important to provide a characterization of submaximal clones in the lattice of clones. It is known that the clones $Pol(\theta)$ and $Pol(\rho)$ (where $\theta$ is a nontrivial equivalence relation on $E_k = \{0,\dots, k-1\}$, and $\rho$ is among the six types of relations which characterize maximal clones) are maximal clones. In this paper, we provide a classification of relations (of Rosenberg's List) on $E_k$ such that the clone $Pol(\theta) \cap Pol(\rho)$ is maximal in $Pol(\theta)$.
Explore related subjects
Keep this discovery
Luc E. F. Diekouam, Etienne R. A. Temgoua, Marcel Tonga. 2016-11-20. Meet-reducible submaximal clones determined by nontrivial equivalence relations. https://doi.org/10.18642/jantaa_7100121803
Cite the original work for its findings. Save a collection to share your selection of sources.