Hostname: page-component-78c5997874-fbnjt Total loading time: 0 Render date: 2024-11-12T21:41:42.352Z Has data issue: false hasContentIssue false

Crowns, Fences, and Dismantlable Lattices

Published online by Cambridge University Press:  20 November 2018

David Kelly
Affiliation:
University of Manitoba, Winnipeg, Manitoba
Ivan Rival
Affiliation:
University of Manitoba, Winnipeg, Manitoba
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A finite lattice L of order n is dismantlable [6] if there is a chain L1L2 ⊂ . . . ⊂ Ln = L of sublattices of L such that |Li| = i for every i = 1, 2, . . . , n. In [1] it was shown that every finite planar lattice is dismantlable. Furthermore, every lattice L with |L| ≦ 7 is dismantlable [6]; in fact, every large enough lattice contains a dismantlable sublattice with precisely n elements [4]. As well, such lattices are closed under the formation of sublattices and homomorphic images [6].

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1974

References

1. Baker, K. A., Fishburn, P. C., and Roberts, F. S., Partial orders of dimension 2, interval orders, and interval graphs, The Rand Corp. P-4376 (1970).Google Scholar
2. Birkhoff, G., Lattice theory, 3rd. ed. (American Mathematical Society, Providence, R.I., 1967).Google Scholar
3. Dilworth, R. P., A decomposition theorem for partially ordered sets, Ann. of Math. 51 (1950), 161166.Google Scholar
4. Havas, G. and Ward, M., Lattices with sublattices of a given order, J. Combinatorial Theory 7 (1969), 281282.Google Scholar
5. Herrmann, C., Quasiplanare Verbände, Arch. Math. (Basel) 24 (1973), 217220.Google Scholar
6. Rival, I., Lattices with doubly irreducible elements, Can. Math. Bull. 17 (1974).Google Scholar
7. Wille, R., Modular lattices of order dimension 2y Proc. Amer. Math. Soc. 43 (1974), 287292.Google Scholar