Meet-reducible submaximal clones determined by two central relations
Jeufack L.T. Yannick, Luc E. F. Diekouam, Etienne R. A. Temgoua

TL;DR
This paper characterizes specific central relations on finite sets where the combined clone of their preserving operations forms a maximal subclone of a fixed central relation's clone, advancing understanding of clone lattice structures.
Contribution
It identifies all central relations sigma for which the join of Pol(rho) and Pol(sigma) yields a maximal subclone of Pol(rho), given a fixed central relation rho.
Findings
Characterization of central relations sigma with maximal join clones
Complete description of submaximal clones determined by two central relations
Advancement in understanding the structure of clone lattices on finite sets
Abstract
Let rho and sigma be two central relations on a finite set A. It is known that the clones Pol(rho) and Pol(sigma) which consists of all operations on A that preserve rho respectively sigma are among the maximal clones on A. In this paper, we find all central relations sigma such that the join clone of Pol(rho) and Pol(sigma) is a maximal subclone of Pol(rho) where rho is a fixed central relation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic · semigroups and automata theory · Rough Sets and Fuzzy Logic
