Combinatorics in finite lattices

Joseph P. S. Kung
Additional contact information
Joseph P. S. Kung: University of Manitoba, Department of Mathematics

Chapter Chapter 6 in Lattice Theory: Special Topics and Applications, 2014, pp 195-229 from Springer

Abstract: 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.

Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-06413-0_6

Ordering information: This item can be ordered from
http://www.springer.com/9783319064130

DOI: 10.1007/978-3-319-06413-0_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().