On partially ordered sets embeddable in a free lattice
β Scribed by J. B. Nation
- Publisher
- Springer
- Year
- 1984
- Tongue
- English
- Weight
- 313 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0002-5240
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Behrendt, G., The lattice of antichain cutsets of a partially ordered set, Discrete Mathematics 89 (1991) 201-202. Every finite lattice is isomorphic to the lattice of antichain cutsets of a finite partially ordered set whose chains have at most three elements. A subset A of a partially order
Let (Z~a, <) be a finite partially ordered set with rank function. Then ff is the disjoint union of the classes ~k of elements of rank k and the order relation between elements in ~k and ~ak+ 1 can be represented by a matrix S k. We study partially ordered sets which satisfy linear recurrence relati
The average height of an element x in a finite poset P is the expected number of elements below x in a random linear extension of P. We prove a number of theorems about average height, some intuitive and some not, using a recent result of L.A. Shepp. Let P be an arbitrary finite poset having n elem