A polynomial bound for the number of maximal systems of imprimitivity of a finite transitive permutation group (Q2178802): Difference between revisions

\textit{G. E. Wall} [J. Aust. Math. Soc. 2, 35--59 (1961; Zbl 0121.27302)] proved that a finite soluble group \(G\) has less than \(|G|\) maximal subgroups. The authors develop and extend this theorem as follows. Let \(\max(H,G)\) denote the number of maximal subgroups of the group \(G\) containing its subgroup \(H\). They prove the following. There exists a constant \(c\) such that for every finite group \(G\) and every subgroup \(H\) of \(G\) we have \(\max(H,G)\leq a|G:H|^{3/2}\) and if \(G\) is also soluble then \(\max(H,G)<|G:H|\). It follows that a transitive permutation group \(G\) of degree \(n>1\) has at most \(an^{3/2}\) (at most \(n-1\) if \(G\) is soluble) maximal systems of imprimitivity.