Counting finite lattices.
From MaRDI portal
Publication:1771934
DOI10.1007/PL00013837zbMath1058.05002MaRDI QIDQ1771934
Jürgen Reinhold, Jobst Heitzig
Publication date: 19 April 2005
Published in: Algebra Universalis (Search for Journal in Brave)
05A15: Exact enumeration problems, generating functions
06A07: Combinatorics of partially ordered sets
Related Items
Counting graded lattices of rank 3 that have few coatoms, Unnamed Item, A lattice-theoretic approach to the Bourque–Ligh conjecture, The asymptotic number of planar, slim, semimodular lattice diagrams, Generating all finite modular lattices of a given size, Residuated lattices of size \(\leq 12\), Exponential lower bounds of lattice counts by vertical sum and 2-sum, How many ways can two composition series intersect?, Enumeration of finite inverse semigroups, Probability over Płonka sums of Boolean algebras: states, metrics and topology, Generating modular lattices of up to 30 elements, Constructing unlabelled lattices, A framework for the systematic determination of the posets on \(n\) points with at least \(\tau \cdot 2^n\) downsets, Small orthomodular partial algebras., The number of slim rectangular lattices., On the number of slim, semimodular lattices