Cartesian lattice counting by the vertical 2-sum
From MaRDI portal
(Redirected from Publication:2141002)
Recommendations
Cites work
- Constructing unlabelled lattices
- Counting finite lattices.
- Counting Steiner triple systems
- Exponential lower bounds of lattice counts by vertical sum and 2-sum
- Generating all finite modular lattices of a given size
- Generating modular lattices of up to 30 elements
- Lattice Theory: Foundation
- Nonisomorphic Steiner triple systems
- On the number of distributive lattices
- Planar lattices are lexicographically shellable
- Practical graph isomorphism. II.
- Shellable and Cohen-Macaulay Partially Ordered Sets
- Whitney Number Inequalities for Geometric Lattices
Cited in
(8)- On the number of distributive lattices
- Exponential lower bounds of lattice counts by vertical sum and 2-sum
- Generating modular lattices of up to 30 elements
- scientific article; zbMATH DE number 2163326 (Why is no real title available?)
- Counting graded lattices of rank 3 that have few coatoms
- Cartesian lattice counting by the vertical 2-sum
- Simplifying modular lattices by removing doubly irreducible elements
- On distributive triads
This page was built for publication: Cartesian lattice counting by the vertical 2-sum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2141002)
