<?xml version="1.0" encoding="UTF-8"?>
<collection>
<dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><dc:identifier>doi:10.22108/ijgt.2019.114469.1521</dc:identifier><dc:language>eng</dc:language><dc:creator>Ballester-Bolinches, Adolfo</dc:creator><dc:creator>Esteban-Romero, Ramón</dc:creator><dc:creator>Jimenez-Seral, Paz</dc:creator><dc:creator>Meng, Hangyang</dc:creator><dc:title>The number of maximal subgroups and probabilistic generation of finite groups</dc:title><dc:identifier>ART-2020-117524</dc:identifier><dc:description>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.</dc:description><dc:date>2020</dc:date><dc:source>http://zaguan.unizar.es/record/89268</dc:source><dc:doi>10.22108/ijgt.2019.114469.1521</dc:doi><dc:identifier>http://zaguan.unizar.es/record/89268</dc:identifier><dc:identifier>oai:zaguan.unizar.es:89268</dc:identifier><dc:relation>info:eu-repo/grantAgreement/ES/MINECO/MTM2014-54707-C3-1-P</dc:relation><dc:identifier.citation>International Journal of Group Theory 9, 1 (2020), 31-42</dc:identifier.citation><dc:rights>by</dc:rights><dc:rights>http://creativecommons.org/licenses/by/3.0/es/</dc:rights><dc:rights>info:eu-repo/semantics/openAccess</dc:rights></dc:dc>

</collection>