Abstract
The first basic technique is the use of a chopped lattice, a finite meet-semilattice 〈M,∧〉 regarded as a partial algebra 〈M,∧,∨〉, where ∨ is a partial operation. It turns out that the ideals of a chopped lattice form a lattice with the same congruence lattice as that of the chopped lattice. So to construct a finite lattice with a given congruence lattice it is enough to construct such a chopped lattice. The problem is how to ensure that the ideal lattice of the chopped lattice has some given properties. As an example, we will look at sectionally complemented lattices.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2006 Birkhäuser Boston
About this chapter
Cite this chapter
(2006). Chopped Lattices. In: The Congruences of a Finite Lattice. Birkhäuser Boston. https://doi.org/10.1007/0-8176-4462-8_4
Download citation
DOI: https://doi.org/10.1007/0-8176-4462-8_4
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-3224-3
Online ISBN: 978-0-8176-4462-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)