The exponent of finite groups
From MaRDI portal
In this note it is proved that the exponent of an \(m\)-generated finite group divides \(n\) as soon as the probability of a random element to have order diving \(n\) is large enough. And ``large enough means that such probability is greater or equal than a function, depending on \(m\) and \(n\), and constructed by using the order of the biggest \(m\)-generated finite group of exponent \(n\), whose existence is known by the positive solution to the restricted Burnside problem by E. Zelmanov.
Recommendations
Cites work
Cited in
(10)- The exponent of convergence of Poincaré series of combination groups
- On elements of order \(p\) in powerful \(p\)-groups.
- On the exponent of the product of two groups.
- On the exponent of a verbal subgroup in a finite group.
- scientific article; zbMATH DE number 3873591 (Why is no real title available?)
- scientific article; zbMATH DE number 5008089 (Why is no real title available?)
- scientific article; zbMATH DE number 553899 (Why is no real title available?)
- Groups satisfying identities with high probability
- scientific article; zbMATH DE number 1364531 (Why is no real title available?)
- Asymptotic Burnside laws
This page was built for publication: The exponent of finite groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1924942)