No label defined (Q3218281)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3884355
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3884355 |
Statements
1984
0 references
orders of products of permutations
0 references
0.7770553231239319
0 references
0.7720283269882202
0 references
0.75246661901474
0 references
[For Part III, cf. Pure Appl. Math. Sci. 20, 37-51 (1984; Zbl 0551.20002).] Suppose that \(A, B\) are permutations of orders \(a,b\), and \(C=AB\) has order \(c\). Let \(m=\max \{a,b,c\}\). \textit{G. A. Miller} [Am. J. Math. 22, 185-190 (1900)] showed that we can take \(A\) and \(B\) in \(S_ d\), where \(d=m\), \(m+1\) or \(m+2\) (depending on the parities of \(a\), \(b\) and \(c\)). Here, the authors give a very illuminating proof. In later papers, they propose to prove sharper results on the minimal choice of \(d\). Let \(s(x)\) denote the sum of primary factors of an integer x, and put \(s=\max \{s(a),s(b),s(c)\}\). Clearly, we require \(d\geq s\). They conjecture that, when \(a,b,c\geq 2\), we can choose \(d\leq s+2\).
0 references