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

DOI10.4171/JCA/51MaRDI QIDQ2233684

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

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

Related Items (2)

An upper bound for the nonsolvable length of a finite group in terms of its shortest law ⋮ Probabilistically nilpotent groups of class two

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A probabilistic Tits alternative and probabilistic identities
• Nonsoluble and non-\(p\)-soluble length of finite groups.
• Verbal width in anabelian groups
• A general Brauer-Fowler theorem and centralizers in locally finite groups
• Words, Hausdorff dimension and randomly free groups
• Fibers of automorphic word maps and an application to composition factors
• Probabilistic Waring problems for finite simple groups
• Remarks on profinite groups having few open subgroups
• Probabilistically nilpotent groups
• On the p -Length of p -Soluble Groups and Reduction Theorems for Burnside's Problem
• A NEW TYPE OF SIMPLE GROUPS OF FINITE ORDER
• SOLUTION OF THE RESTRICTED BURNSIDE PROBLEM FOR GROUPS OF ODD EXPONENT
• Fibers of word maps and the multiplicities of non-abelian composition factors

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