Proves that the number of maximal subgroups containing H in finite G is bounded by a|G:H|^{3/2}, with a linear bound |G:H|-1 when G is soluble, implying a polynomial bound on maximal imprimitivity systems in transitive permutation groups of degree n.
Tullio Levi-C ivita
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.GR 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A polynomial bound for the number of maximal systems of imprimitivity of a finite transitive permutation group
Proves that the number of maximal subgroups containing H in finite G is bounded by a|G:H|^{3/2}, with a linear bound |G:H|-1 when G is soluble, implying a polynomial bound on maximal imprimitivity systems in transitive permutation groups of degree n.