Abstract
In his doctoral dissertation Crapo had enumerated them for n ≤ 8. With Gaskill we have pursued this question uising an idea of “minimal inequalities” acconling to which the question essentially reduces to enumerating the number of nondecomposable geometric lattices on n atoms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Kluwer Academic Publishers
About this chapter
Cite this chapter
Rival, I. (1989). Enumeration. In: Rival, I. (eds) Algorithms and Order. NATO ASI Series, vol 255. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-2639-4_18
Download citation
DOI: https://doi.org/10.1007/978-94-009-2639-4_18
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-7691-3
Online ISBN: 978-94-009-2639-4
eBook Packages: Springer Book Archive