The number of maximal subgroups and probabilistic generation of finite groups
[EN] In this survey we present some significant bounds for the number of maximal subgroups of a given index of a finite group. As a consequence, new bounds for the number of random generators needed to generate a finite d-generated group with high probability which are significantly tighter than the...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2020 |
| País: | España |
| Institución: | Universitat Politècnica de València (UPV) |
| Repositorio: | RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia |
| Idioma: | inglés |
| OAI Identifier: | oai:riunet.upv.es:10251/169538 |
| Acceso en línea: | https://riunet.upv.es/handle/10251/169538 |
| Access Level: | acceso abierto |
| Palabra clave: | Finite group Maximal subgroup Probabilistic generation Primitive group MATEMATICA APLICADA |
| Sumario: | [EN] In this survey we present some significant bounds for the number of maximal subgroups of a given index of a finite group. As a consequence, new bounds for the number of random generators needed to generate a finite d-generated group with high probability which are significantly tighter than the ones obtained in the paper of Jaikin-Zapirain and Pyber (Random generation of finite and profinite groups and group enumeration, Ann. Math., 183 (2011) 769-814) are obtained. The results of Jaikin-Zapirain and Pyber, as well as other results of Lubotzky, Detomi, and Lucchini, appear as particular cases of our theorems. |
|---|