On powers of conjugacy classes in finite groups (Q2170273)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On powers of conjugacy classes in finite groups |
scientific article; zbMATH DE number 7578084
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On powers of conjugacy classes in finite groups |
scientific article; zbMATH DE number 7578084 |
Statements
On powers of conjugacy classes in finite groups (English)
0 references
30 August 2022
0 references
Let \(K\) and \(D\) be conjugacy classes of a finite group \(G\), and suppose that we have \(K^n = D \cup D^{-1}\) for some integer \(n\geq 2\). Under these assumptions, in 2020 the author et al. [Ann. Mat. Pura Appl. (4) 199, No. 2, 409--424 (2020; Zbl 1471.20022)] put forward the conjecture that \(\langle K\rangle\) must be a (normal) solvable subgroup of \(G\). Recently \textit{R. D. Camina} [J. Group Theory 23, No. 5, 917--923 (2020; Zbl 1476.20032)] showed that the conjecture is valid for any \(n\geq 4\), and this is done by applying combinatorial results, the main of which (by \textit{G. A. Freiman} [Proc. Am. Math. Soc. 140, No. 9, 2997--3002 (2012; Zbl 1284.20024)]) concerns subsets with small doubling in a finite group. In this note, the authors solve the case \(n=3\) by appealing to other combinatorial results, such as an estimate of the cardinality of the product of two normal sets in a finite group. The proofs depend on CFSG.
0 references
conjugacy class
0 references
solvability citerion
0 references
products of sets
0 references
finite group
0 references
0.8458508849143982
0 references
0.8399357199668884
0 references
0.8342579007148743
0 references
0.8313761353492737
0 references
0.8218246102333069
0 references