Retracts of rectangular distributive lattices and some related observations
G\'abor Cz\'edli

TL;DR
This paper investigates the structure of retracts within rectangular distributive lattices, establishing that their collection forms a lattice, and explores properties and examples including a modular lattice with non-lattice retracts.
Contribution
It proves that the set of retracts of a rectangular distributive lattice forms a lattice and provides descriptions and counts of these retracts, along with related properties and examples.
Findings
Ret($G$) forms a lattice for rectangular distributive lattices
The paper describes and counts the retracts of such lattices
Provides examples including a modular lattice with non-lattice retracts
Abstract
By a rectangular distributive lattice we mean the direct product of two non-singleton finite chains. We prove that the retracts (ordered by set inclusion and together with the empty set) of a rectangular distributive lattice form a lattice, which we denote by Ret(). Also, we describe and count the retracts of . Some easy properties of retracts, retractions, and retraction kernels of (mainly distributive) lattices are observed and several examples are presented, including a 12-element modular lattice such that Ret() is not a lattice.
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
