Abstract
AbstractThe product of two subsets C, D of a group is defined as . The power Ce is defined inductively by C0 = {1}, Ce = CCe−1 = Ce−1C. It is known that in the alternating group An, n > 4, there is a conjugacy class C such that CC covers An. On the other hand, there is a conjugacy class D such that not only DD≠An, but even De≠An for e<[n/2]. It may be conjectured that as n ← ∞, almost all classes C satisfy C3 = An. In this article, it is shown that as n ← ∞, almost all classes C satisfy C4 = An.
Publisher
Cambridge University Press (CUP)
Reference13 articles.
1. Covering theorems for FINASIGS. IX;Brenner;Ars Combinatoria,1977
2. Number of factors in k-cycle decompositions of permutations;Herzog;Proc. 4th Australian Conference Combinatorial Math,1976
3. Covering theorems for finite non-abelian simple groups, I
4. Covering theorems for nonabelian simple groups. II
5. Covering theorems for finite nonabelian simple groups, IV;Brenner;Jñānabha,1975
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献