On the number of distributive lattices
Summary: We investigate the numbers \(d_k\) of all (isomorphism classes of) distributive lattices with \(k\) elements, or, equivalently, of (unlabeled) posets with \(k\) antichains. Closely related and useful for combinatorial identities and inequalities are the numbers \(v_k\) of vertically indecomposable distributive lattices of size \(k\). We present the explicit values of the numbers \(d_k\) and \(v_k\) for \(k<50\) and prove the following exponential bounds: \(1.67^k<v_k<2.33^k\) and \(1.84^k<d_k<2.39^k\) \((k\geq k_0)\). Important tools are (i) an algorithm coding all unlabeled distributive lattices of height \(n\) and size \(k\) by certain integer sequences \(0=z_1\leq\cdots\leq z_n\leq k-2\), and (ii) a ``canonical 2-decomposition of ordinally indecomposable posets into ``2-indecomposable canonical summands.
- Distributive lattices of small width. II: A problem from Stanley's 1986 text \textsl{Enumerative combinatorics}
- Distributivity and decomposability on the lattices satisfying the chain conditions
- Exponential lower bounds of lattice counts by vertical sum and 2-sum
- The number of elements of a given height in a lattice
- How many ways can two composition series intersect?
- The grading numbers of direct product of distributive lattices
- On the exchange and distributivity numbers in geometric lattices
- Cartesian lattice counting by the vertical 2-sum
- A distributive lattice connected with arithmetic progressions of length three
- Generating modular lattices of up to 30 elements
- A framework for the systematic determination of the posets on n points with at least 2ⁿ downsets
- Small orthomodular partial algebras.
- The number of rectangular islands by means of distributive lattices
- The number of slim rectangular lattices.
- The asymptotic number of planar, slim, semimodular lattice diagrams
- scientific article; zbMATH DE number 3843811 (Why is no real title available?)
- scientific article; zbMATH DE number 4198051 (Why is no real title available?)
- scientific article; zbMATH DE number 5373821 (Why is no real title available?)
- scientific article; zbMATH DE number 5623983 (Why is no real title available?)
- scientific article; zbMATH DE number 4037898 (Why is no real title available?)
- The number of lattice rules having given invariants
- Relations between powers of Dedekind numbers and exponential sums related to them
- Radical classes of distributive lattices having the least element
- Counting graded lattices of rank 3 that have few coatoms
- Distributive lattices with strong endomorphism kernel property as direct sums
- Basic retracts and counting of lattices
- scientific article; zbMATH DE number 5492072 (Why is no real title available?)
- Distributive lattices have the intersection property.
- Lie algebras with a finite number of ideals
- \(n\)-annulets of a distributive lattice
- Simplifying modular lattices by removing doubly irreducible elements
- On distributive triads
- Generating all finite modular lattices of a given size
- Dedekind's numbers characterize distributive lattices
- Obtainable sizes of topologies on finite sets
This page was built for publication: On the number of distributive lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1601110)
