On the number of distributive lattices

zbMath0989.05005MaRDI QIDQ1601110

Marcel Erné, Jürgen Reinhold, Jobst Heitzig

Publication date: 1 July 2002

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/121886

zbMATH Keywords

combinatorial identitiesdistributive latticescanonical posetindecomposable posetsordinal (vertical) decomposition

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics of partially ordered sets (06A07) Structure and representation theory of distributive lattices (06D05) Asymptotic enumeration (05A16)

Related Items (14)

Lie algebras with a finite number of ideals ⋮ The asymptotic number of planar, slim, semimodular lattice diagrams ⋮ Cartesian lattice counting by the vertical 2-sum ⋮ The number of slim rectangular lattices. ⋮ Exponential lower bounds of lattice counts by vertical sum and 2-sum ⋮ How many ways can two composition series intersect? ⋮ Obtainable sizes of topologies on finite sets ⋮ Generating modular lattices of up to 30 elements ⋮ Generating all finite modular lattices of a given size ⋮ Counting graded lattices of rank 3 that have few coatoms ⋮ A framework for the systematic determination of the posets on \(n\) points with at least \(\tau \cdot 2^n\) downsets ⋮ Unnamed Item ⋮ Distributive lattices have the intersection property ⋮ Small orthomodular partial algebras.

This page was built for publication: On the number of distributive lattices