The asymptotic number of planar, slim, semimodular lattice diagrams (Q304178): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / author | |||
Property / author: Gábor Czédli / rank | |||
Normal rank | |||
Property / review text | |||
The author gives interesting results on the number \(N_{\mathrm{ssd}}(n)\) of slim, semimodular diagrams of size \(n\). More precisely, it is proved that there exists a positive constant \(C < 1\) such that \(N_{\mathrm{ssd}}(n)\) is asymptotically \(C \cdot 2^n\), that is, \(\lim_{n\rightarrow \infty}(N_{\mathrm{ssd}}(n)/2^n)=C\). This result allows us to know many ways the members of two composition series in a group can intersect each other, provided that there are exactly \(n\) intersections and that we make a distinction between the first composition series and the second. | |||
Property / review text: The author gives interesting results on the number \(N_{\mathrm{ssd}}(n)\) of slim, semimodular diagrams of size \(n\). More precisely, it is proved that there exists a positive constant \(C < 1\) such that \(N_{\mathrm{ssd}}(n)\) is asymptotically \(C \cdot 2^n\), that is, \(\lim_{n\rightarrow \infty}(N_{\mathrm{ssd}}(n)/2^n)=C\). This result allows us to know many ways the members of two composition series in a group can intersect each other, provided that there are exactly \(n\) intersections and that we make a distinction between the first composition series and the second. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Lavinia Corina Ciungu / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 06C10 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 06A07 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6619134 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
counting lattices | |||
Property / zbMATH Keywords: counting lattices / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
semimodularity | |||
Property / zbMATH Keywords: semimodularity / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
planar lattice diagram | |||
Property / zbMATH Keywords: planar lattice diagram / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
slim semimodular lattice | |||
Property / zbMATH Keywords: slim semimodular lattice / rank | |||
Normal rank |
Revision as of 22:38, 27 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The asymptotic number of planar, slim, semimodular lattice diagrams |
scientific article |
Statements
The asymptotic number of planar, slim, semimodular lattice diagrams (English)
0 references
24 August 2016
0 references
The author gives interesting results on the number \(N_{\mathrm{ssd}}(n)\) of slim, semimodular diagrams of size \(n\). More precisely, it is proved that there exists a positive constant \(C < 1\) such that \(N_{\mathrm{ssd}}(n)\) is asymptotically \(C \cdot 2^n\), that is, \(\lim_{n\rightarrow \infty}(N_{\mathrm{ssd}}(n)/2^n)=C\). This result allows us to know many ways the members of two composition series in a group can intersect each other, provided that there are exactly \(n\) intersections and that we make a distinction between the first composition series and the second.
0 references
counting lattices
0 references
semimodularity
0 references
planar lattice diagram
0 references
slim semimodular lattice
0 references