Abstract
Combinatorial or counting problems in lattices were asked as soon as lattices were discovered. In one of the founding papers of lattice theory, [62], Richard Dedekind asked for the number of elements in the free distributive lattice with n generators.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Kung, J.P.S. (2014). Combinatorics in finite lattices. In: Grätzer, G., Wehrung, F. (eds) Lattice Theory: Special Topics and Applications. Birkhäuser, Cham. https://doi.org/10.1007/978-3-319-06413-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-06413-0_6
Published:
Publisher Name: Birkhäuser, Cham
Print ISBN: 978-3-319-06412-3
Online ISBN: 978-3-319-06413-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)