A polynomial bound for the number of maximal systems of imprimitivity of a finite transitive permutation group
From MaRDI portal
Publication:2178802
DOI10.1515/forum-2019-0222zbMath1442.20017arXiv1907.08477OpenAlexW3006806384MaRDI QIDQ2178802
Mariapia Moscatiello, Pablo Spiga, Andrea Lucchini
Publication date: 11 May 2020
Published in: Forum Mathematicum (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.08477
Arithmetic and combinatorial problems involving abstract finite groups (20D60) Maximal subgroups (20E28) Primitive groups (20B15) General theory for finite permutation groups (20B05)
Cites Work
- Unnamed Item
- Unnamed Item
- Simple groups, maximal subgroups, and probabilistic aspects of profinite groups
- On complemented nonabelian chief factors of a finite group
- Crowns and factorization of the probabilistic zeta function of a finite group.
- On a conjecture of G. E. Wall.
- Permutation Groups and Cartesian Decompositions
- Intersections of maximal subgroups in prosolvable groups
- Classes of Finite Groups
- Some applications of the Eulerian functions of a finite group
This page was built for publication: A polynomial bound for the number of maximal systems of imprimitivity of a finite transitive permutation group