Some combinatorial aspects of congruence lattice representations
✍ Scribed by G. Grätzer; E.T. Schmidt
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 629 KB
- Volume
- 217
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
✦ Synopsis
A finite distributive lattice D can be represented as the congruence lattice, Con L, of a finite lattice L. We shall discuss the combinatorial aspects of such -and related -representations, specifically, optimal size, breadth, and degree of symmetry @ I999-Elsevier Science B.V.
📜 SIMILAR VOLUMES
Schmidt proved that every distributive lattice with n join-irreducible elements can be represented as the congruence lattice of a "small" lattice I,, that is, a lattice L with O(r?) elements. G. Gratzer, I. Rival, and N. Zaguia proved that, for any o < 2, O(n\*) can not be improved to O(rF). In this
## Abstract For Abstract see ChemInform Abstract in Full Text.