Bias of group generators in finite and profinite groups: known results and open problems

DOI10.22108/ijgt.2015.9895zbMath1456.20077OpenAlexW1716740397MaRDI QIDQ5853461

Eleonora Crestani, Andrea Lucchini

Publication date: 10 March 2021

Full work available at URL: https://ijgt.ui.ac.ir/article_9895_88e6083ca4021d45413514f530fff685.pdf

zbMATH Keywords

profinite groupsgroup generatorsproduct replacement algorithm

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Generators, relations, and presentations of groups (20F05) Limits, profinite groups (20E18) Probabilistic methods in group theory (20P05)

Related Items (1)

The limiting distribution of the product replacement algorithm for finitely generated prosoluble groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The probability of generating a finite simple group.
• Bias of group generators in the solvable case.
• Simple groups, maximal subgroups, and probabilistic aspects of profinite groups
• The probability of generating a finite simple group
• 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
• The product replacement algorithm and Kazhdan’s property (T)
• Probability and Bias in Generating Supersoluble Groups
• The X-Dirichlet polynomial of a finite group
• Generating random elements of a finite group
• Positively finitely generated groups
• The probability of generating the symmetric group

This page was built for publication: Bias of group generators in finite and profinite groups: known results and open problems