A polynomial bound for the number of maximal systems of imprimitivity of a finite transitive permutation group

DOI10.1515/FORUM-2019-0222MaRDI QIDQ2178802zbMATH OpenOpenAlexFDO

Authors Andrea Lucchini, Mariapia Moscatiello, Pablo Spiga

Publication date 11 May 2020

Published in Forum Mathematicum (Search for Journal in Brave)

Copyright license File:Creative commons license with attribution.png Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1907.08477

zbMATH Keywords

maximal subgroupspermutation groupssystems of imprimitivity

Mathematics Subject Classification ID

General theory for finite permutation groups (20B05) Primitive groups (20B15) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Maximal subgroups (20E28)

Abstract: We show that, there exists a constant $a$ such that, for every subgroup $H$ of a finite group $G$, the number of maximal subgroups of $G$ containing $H$ is bounded above by $a|G:H{|}^{3/2}$. In particular, a transitive permutation group of degree $n$ has at most $a{n}^{3/2}$ maximal systems of imprimitivity. When $G$ is soluble, generalizing a classic result of Tim Wall, we prove a much stroger bound, that is, the number of maximal subgroups of $G$ containing $H$ is at most $|G:H|-1$.

Review text

\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.

Recommendations

• On the distance from permutations to imprimitive groups for a fixed system of imprimitivity.
• Bounds on finite quasiprimitive permutation groups
• A bound on the rank of primitive solvable permutation groups
• On the maximal number of coprime subdegrees in finite primitive permutation groups
• On the distance from permutations to the union of all imprimitive groups with identical parameters of imprimitivity systems.
• On the maximum order of nilpotent transitive permutation groups.
• scientific article; zbMATH DE number 7310102
• Bounds for finite semiprimitive permutation groups: order, base size, and minimal degree
• An upper bound for the order of primitive permutation groups

Cites work

• Classes of Finite Groups
• Crowns and factorization of the probabilistic zeta function of a finite group.
• scientific article; zbMATH DE number 4015004 (Why is no real title available?)
• scientific article; zbMATH DE number 1261512 (Why is no real title available?)
• Intersections of maximal subgroups in prosolvable groups
• On a conjecture of G. E. Wall.
• On complemented nonabelian chief factors of a finite group
• Permutation groups and Cartesian decompositions
• Simple groups, maximal subgroups, and probabilistic aspects of profinite groups
• Some applications of the Eulerian functions of a finite group

Cited in

(3)

• Maximal subgroups in finite and profinite groups
• Counting subgroups of a finite group containing a prescribed subgroup
• On the distance from permutations to the union of all imprimitive groups with identical parameters of imprimitivity systems.

This page was built for publication: A polynomial bound for the number of maximal systems of imprimitivity of a finite transitive permutation group

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2178802)