On the probability of generating free prosoluble groups of small rank.
From MaRDI portal
Publication:2472729
DOI10.1007/BF02773951zbMath1139.20025MaRDI QIDQ2472729
Publication date: 22 February 2008
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
probability distributionspositively finitely generated groupsfinitely generated prosoluble groupspolynomial maximal subgroup growth
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
The expected number of random elements to generate a finite group ⋮ 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. ⋮ Maximal subgroup growth of some metabelian groups
Cites Work
- Unnamed Item
- A polynomial bound for the orders of primitive solvable groups
- On the probability of generating prosoluble groups.
- The probability of generating a finite classical group
- Maximal subgroups in finite and profinite groups
- Positively finitely generated groups
- The Fitting subgroup of a linear solvable group