On two problems about order sequences of finite groups

From MaRDI portal





The order sequence \(\mathrm{os}(G)\) of a finite group \(G\) is the non-decreasing sequence of element orders of \(G\). For groups of the same order, a partial order is defined by domination: \(\mathrm{os}(G)\) dominates \(\mathrm{os}(H)\) if the \(i\)-th term of \(\mathrm{os}(G)\) is at least the \(i\)-th term of \(\mathrm{os}(H)\) for all \(i\). The author solves two problems posed by \textit{P.~J.~Cameron} and \textit{H.~K.~Dey} [Electron. J. Comb. 32, No. 2, Research Paper P2.9, 21 p. (2025; Zbl 1565.20046)].\N\NTheorem 2.3 shows that there are infinitely many positive integers \(n\) such that there exists a unique non-solvable group \(H\) of order \(n\) whose order sequence properly dominates the order sequence of some solvable group \(G\) of order \(n\).\N\NTheorem 2.9 shows that supersolvability cannot be determined by order sequences alone, constructing pairs of groups with identical order sequences where one is supersolvable and the other is not.











This page was built for publication: On two problems about order sequences of finite groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6902460)