We show that there exist a set of polynomials {Lk 1 k = 0, 1 \* \* a} such that L,(n) is the number of elements of rank k in the free distributive lattice on n generators. L,(n) = L,(n) = 1 for all n and the degree of L, is k -1 for k 5 1. We show that the coefficients of the L, can be calculated us
The skeletons of free distributive lattices
β Scribed by Rudolf Wille
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 707 KB
- Volume
- 88
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
The skeletons of free distributive lattices are studied by methods of formal concept analysis; in particular, a specific closure system of sublattices is elaborated to clarify the structure of the skeletons.
Up to five generators, the skeletons are completely described.
π SIMILAR VOLUMES
In 1983. Wille raised the question: Is elery complete lattice \(L\) isomorphic to the lattice of complete congruence relations of a suitable complete lattice K? In 1988 . this was answered in the affirmative by the first author. A number of papers have been published on this problem by Freese, Johns
This paper gives a method for computing the reduced poset homology of the rank-selected subposet of a distributive lattice. As an example of the method, let L be the lattice S b acts on L by permuting coordinates. For S β [ab], we give a description of the decomposition of the reduced homology of L