Words, permutations, and the nonsolvable length of a finite group

DOI10.4171/JCA/51MaRDI QIDQ2233684zbMATH OpenFDO

Authors Alexander Bors, Aner Shalev

Publication date 11 October 2021

Published in Journal of Combinatorial Algebra (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1904.02370

zbMATH Keywords

finite groupsidentitiesword mapsnonsolvable lengthprobabilistic identities

Mathematics Subject Classification ID

General theory for finite permutation groups (20B05) Simple groups: alternating groups and groups of Lie type (20D06) Probabilistic methods in group theory (20P05) Other classes of groups defined by subgroup chains (20F22) Quasivarieties and varieties of groups (20E10)

Recommendations

• An upper bound for the nonsolvable length of a finite group in terms of its shortest law
• A reduction theorem for nonsolvable finite groups
• A characterization of finite soluble groups
• On the probability of satisfying a word in a group

Cites work

• scientific article; zbMATH DE number 1818892 (Why is no real title available?)
• scientific article; zbMATH DE number 3758564 (Why is no real title available?)
• scientific article; zbMATH DE number 847283 (Why is no real title available?)
• A NEW TYPE OF SIMPLE GROUPS OF FINITE ORDER
• A general Brauer-Fowler theorem and centralizers in locally finite groups
• A probabilistic Tits alternative and probabilistic identities
• Fibers of automorphic word maps and an application to composition factors
• Fibers of word maps and the multiplicities of non-abelian composition factors
• Nonsoluble and non-\(p\)-soluble length of finite groups.
• On the p -Length of p -Soluble Groups and Reduction Theorems for Burnside's Problem
• Probabilistic Waring problems for finite simple groups
• Probabilistically nilpotent groups
• Remarks on profinite groups having few open subgroups
• SOLUTION OF THE RESTRICTED BURNSIDE PROBLEM FOR GROUPS OF ODD EXPONENT
• Solution of the restricted Burnside problem for 2-groups
• Verbal width in anabelian groups
• Words, Hausdorff dimension and randomly free groups

Cited in

(6)

• Words, permutations, and the nonsolvable length of a finite group
• Number of cyclically irreducible words in the alphabet of a free group of finite rank
• Words and mixing times in finite simple groups.
• An upper bound for the nonsolvable length of a finite group in terms of its shortest law
• Congruences between word length statistics for the finitary alternating and symmetric groups
• Probabilistically nilpotent groups of class two

This page was built for publication: Words, permutations, and the nonsolvable length of a finite group

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233684)