On the probability of generating prosoluble groups.

DOI10.1007/BF02773950zbMath1158.20010OpenAlexW2004068540MaRDI QIDQ2472728

Andrea Lucchini, Federico Menegazzo, Marta Morigi

Publication date: 22 February 2008

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02773950

zbMATH Keywords

finite soluble groupsrandom generationpositively finitely generated groupsfree prosoluble groupsgenerating tuplespolynomial maximal subgroup growth

Mathematics Subject Classification ID

Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Subgroup theorems; subgroup growth (20E07) Maximal subgroups (20E28) Generators, relations, and presentations of groups (20F05) Limits, profinite groups (20E18) Probabilistic methods in group theory (20P05)

Related Items (6)

The limiting distribution of the product replacement algorithm for finitely generated prosoluble groups ⋮ Bias of group generators in finite and profinite groups: known results and open problems ⋮ Probability and Bias in Generating Supersoluble Groups ⋮ Bias of group generators in the solvable case. ⋮ On the probability of generating free prosoluble groups of small rank. ⋮ Maximal subgroup growth of some metabelian groups

Cites Work

• Unnamed Item
• Die Eulersche Funktion endlicher auflösbarer Gruppen
• Automorphisms of permutational wreath products
• A polynomial bound for the orders of primitive solvable groups
• Generating wreath products
• Enumerating finite groups of given order
• The probability of generating a finite classical group
• A PROBABILISTIC ZETA FUNCTION FOR ARITHMETIC GROUPS
• Positively finitely generated groups
• The Fitting subgroup of a linear solvable group

This page was built for publication: On the probability of generating prosoluble groups.