The asymptotic number of planar, slim, semimodular lattice diagrams
From MaRDI portal
Publication:304178
Abstract: A lattice L is slim if it is finite and the set of its join-irreducible elements contains no three-element antichain. We prove that there exists a positive constant C such that, up to similarity, the number of planar diagrams of these lattices of size n is asymptotically C times 2 to the n.
Recommendations
Cites work
- scientific article; zbMATH DE number 2163326 (Why is no real title available?)
- Composition series in groups and the structure of slim semimodular lattices.
- Counting finite lattices.
- Eine Verallgemeinerung der invarianten Untergruppen
- How many ways can two composition series intersect?
- How to derive finite semimodular lattices from distributive lattices?
- Jónsson's contributions to lattice theory
- Notes on planar semimodular lattices. I. Construction
- On the number of distributive lattices
- On the number of slim, semimodular lattices
- Planar Lattices
- Slim semimodular lattices. I. A visual approach
- The Jordan-Hölder theorem with uniqueness for groups and semimodular lattices
Cited in
(11)- On the number of slim, semimodular lattices
- Notes on planar semimodular lattices. VII: Resections of planar semimodular lattices
- How many ways can two composition series intersect?
- Slim semimodular lattices. I. A visual approach
- Basic retracts and counting of lattices
- The Number of Plane Diagrams of a Lattice
- Quasiplanar diagrams and slim semimodular lattices
- scientific article; zbMATH DE number 7536565 (Why is no real title available?)
- Patch extensions and trajectory colorings of slim rectangular lattices.
- Notes on planar semimodular lattices IX C1-diagrams
- The matrix of a slim semimodular lattice
This page was built for publication: The asymptotic number of planar, slim, semimodular lattice diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q304178)