The following pages link to Counting finite lattices. (Q1771934):
Displayed 17 items.
- The asymptotic number of planar, slim, semimodular lattice diagrams (Q304178) (← links)
- Generating all finite modular lattices of a given size (Q745707) (← links)
- Residuated lattices of size \(\leq 12\) (Q981681) (← links)
- Exponential lower bounds of lattice counts by vertical sum and 2-sum (Q1729793) (← links)
- How many ways can two composition series intersect? (Q1759394) (← links)
- Enumeration of finite inverse semigroups (Q2009659) (← links)
- Cartesian lattice counting by the vertical 2-sum (Q2141002) (← links)
- Probability over Płonka sums of Boolean algebras: states, metrics and topology (Q2237506) (← links)
- Generating modular lattices of up to 30 elements (Q2279675) (← links)
- Constructing unlabelled lattices (Q2282992) (← links)
- A framework for the systematic determination of the posets on \(n\) points with at least \(\tau \cdot 2^n\) downsets (Q2314416) (← links)
- Small orthomodular partial algebras. (Q2343035) (← links)
- The number of slim rectangular lattices. (Q2634705) (← links)
- On the number of slim, semimodular lattices (Q2810996) (← links)
- Counting graded lattices of rank 3 that have few coatoms (Q4968235) (← links)
- (Q5139691) (← links)
- A lattice-theoretic approach to the Bourque–Ligh conjecture (Q5240729) (← links)