Name
Abstract | ||
|---|---|---|
Let H→ and K→ be finite composition series of length h in a group G. The intersections of their members form a lattice CSL(H→,K→) under set inclusion. Our main result determines the number N(h) of (isomorphism classes) of these lattices recursively. We also show that this number is asymptotically h!/2. If the members of H→ and K→ are considered constants, then there are exactly h! such lattices. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.disc.2012.08.003 | Discrete Mathematics |
Keywords | Field | DocType |
Composition series,Group,Jordan–Hölder theorem,Counting lattices,Counting matrices,Semimodularity,Slim lattice,Planar lattice,Semimodular lattice | Discrete mathematics,Composition series,Combinatorics,Lattice (order),Matrix (mathematics),Dual polyhedron,Permutation,Isomorphism,Semimodular lattice,Indecomposable module,Mathematics | Journal |
Volume | Issue | ISSN |
312 | 24 | 0012-365X |
Citations | PageRank | References |
5 | 0.76 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gábor Czédli | 1 | 46 | 12.54 |
| László Ozsvárt | 2 | 5 | 1.10 |
| Balázs Udvari | 3 | 15 | 1.52 |