The perfect order subset conjecture for simple groups. (Q2438012): Difference between revisions

Let \(G\) be a finite group. \(G\) has an element of order \(N\), and let \(O_N(G)\) be the set of all elements of \(G\) of order \(N\), called an order subset for \(G\). A perfect order subset is one whose cardinality divides the group order. The POS Conjecture for simple groups states that every finite simple group except \(Z_2\) contains a nonempty order subset that is not perfect (see [\textit{C. E. Finch} and \textit{L. Jones}, JP J. Algebra Number Theory Appl. 3, No. 1, 13-26 (2004; Zbl 1052.20016)]). The authors use the ``maximal cyclic torus methods'' to verify this conjecture. It is proved that the POS Conjecture is true for each nonabelian finite simple group \(G\) unless \(G\) is an orthogonal group of plus type in dimension \(4n\), for some \(n\geq 2\).