The number of slim rectangular lattices.
From MaRDI portal
Publication:2634705
Slim rectangular lattices are finite planar semimodular lattices in which the set of join irreducibles is the cardinal sum of two chains. They are particularly suited for an approach via diagrams. The paper under review gives recursive formulas for the number of such lattices of given length as well as an asymptotic. This is based on a characterization of such lattices in terms of Jordan-Hölder permutations as introduced by Czédli and Schmidt.
Recommendations
Cites work
- A new look at the Jordan-Hölder theorem for semimodular lattices
- Composition series in groups and the structure of slim semimodular lattices.
- Congruence lattices and cover-preserving embeddings of finite length semimodular lattices. I
- Coordinatization of finite join-distributive lattices.
- Counting finite lattices.
- How many ways can two composition series intersect?
- How to derive finite semimodular lattices from distributive lattices?
- scientific article; zbMATH DE number 2163326 (Why is no real title available?)
- Lattice Theory: Foundation
- Notes on planar semimodular lattices. I. Construction
- Notes on planar semimodular lattices. III. Rectangular lattices
- Notes on planar semimodular lattices. IV. The size of a minimal congruence lattice representation with rectangular lattices
- Notes on planar semimodular lattices. VI: On the structure theorem of planar semimodular lattices
- Notes on planar semimodular lattices. VII: Resections of planar semimodular lattices
- On Recursions Connected With Symmetric Groups I
- On the number of distributive lattices
- On the number of slim, semimodular lattices
- Patch extensions and trajectory colorings of slim rectangular lattices.
- Planar Lattices
- Planar semimodular lattices: structure and diagrams
- Representing homomorphisms of distributive lattices as restrictions of congruences of rectangular lattices
- Slim semimodular lattices. I. A visual approach
- Slim semimodular lattices. II: A description by patchwork systems
- Supersolvable lattices
- The gallery distance of flags
- The Jordan-Hölder theorem with uniqueness for groups and semimodular lattices
- The variety generated by planar modular lattices
Cited in
(15)- How many ways can two composition series intersect?
- Slim semimodular lattices. II: A description by patchwork systems
- On the number of slim, semimodular lattices
- Permutations assigned to slim rectangular lattices
- Notes on planar semimodular lattices. IV. The size of a minimal congruence lattice representation with rectangular lattices
- The asymptotic number of planar, slim, semimodular lattice diagrams
- Quasiplanar diagrams and slim semimodular lattices
- Patch extensions and trajectory colorings of slim rectangular lattices.
- Lamps in slim rectangular planar semimodular lattices
- Basic retracts and counting of lattices
- Absolute retracts for finite distributive lattices and slim semimodular lattices
- On slim rectangular lattices
- Slim patch lattices as absolute retracts and maximal lattices
- Reducing the lengths of slim planar semimodular lattices without changing their congruence lattices.
- The matrix of a slim semimodular lattice
This page was built for publication: The number of slim rectangular lattices.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2634705)
