The limiting distribution of the product replacement algorithm for finitely generated prosoluble groups
From MaRDI portal
Publication:324208
DOI10.1016/j.jalgebra.2016.08.008zbMath1383.20017OpenAlexW2510423341MaRDI QIDQ324208
Eloisa Detomi, Andrea Lucchini, Marta Morigi
Publication date: 10 October 2016
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jalgebra.2016.08.008
Generators, relations, and presentations of groups (20F05) Generalizations of solvable and nilpotent groups (20F19) Limits, profinite groups (20E18) Probabilistic methods in group theory (20P05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Bias of group generators in the solvable case.
- Die Eulersche Funktion endlicher auflösbarer Gruppen
- A polynomial bound for the orders of primitive solvable groups
- Generating wreath products
- Enumerating finite groups of given order
- On the probability of generating prosoluble groups.
- On the probability of generating free prosoluble groups of small rank.
- The probability of generating a finite classical group
- Probability and Bias in Generating Supersoluble Groups
- Solvable and Nilpotent Subgroups of GL(n,qm)
- The X-Dirichlet polynomial of a finite group
- Generating random elements of a finite group
- Positively finitely generated groups
- THE EULERIAN FUNCTIONS OF A GROUP
- Bias of group generators in finite and profinite groups: known results and open problems
This page was built for publication: The limiting distribution of the product replacement algorithm for finitely generated prosoluble groups