Counting finite lattices.
From MaRDI portal
Publication:1771934
DOI10.1007/PL00013837zbMath1058.05002OpenAlexW1968473297MaRDI QIDQ1771934
Jürgen Reinhold, Jobst Heitzig
Publication date: 19 April 2005
Published in: Algebra Universalis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00013837
Exact enumeration problems, generating functions (05A15) Combinatorics of partially ordered sets (06A07)
Related Items (17)
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 ⋮ Probability over Płonka sums of Boolean algebras: states, metrics and topology ⋮ How many ways can two composition series intersect? ⋮ Enumeration of finite inverse semigroups ⋮ Residuated lattices of size \(\leq 12\) ⋮ Generating modular lattices of up to 30 elements ⋮ Constructing unlabelled lattices ⋮ On the number of slim, semimodular lattices ⋮ 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 ⋮ A lattice-theoretic approach to the Bourque–Ligh conjecture ⋮ Small orthomodular partial algebras.
This page was built for publication: Counting finite lattices.
