The number of slim rectangular lattices. (Q2634705)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The number of slim rectangular lattices. |
scientific article; zbMATH DE number 6542174
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The number of slim rectangular lattices. |
scientific article; zbMATH DE number 6542174 |
Statements
The number of slim rectangular lattices. (English)
0 references
18 February 2016
0 references
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.
0 references
rectangular lattices
0 references
patch lattices
0 references
semimodularity
0 references
slim lattices
0 references
finite planar semimodular lattices
0 references
planar lattices
0 references
numbers of lattices
0 references
0 references
0 references
0 references
0 references
0.8533179
0 references
0.84057015
0 references
0.8298913
0 references
0.82506883
0 references
