An improvement on the perfect order subsets of finite groups (Q2088979)

A finite group \(G\) is said to have perfect order subsets if for every \(d\) the number of elements of \(G\) of order \(d\) (if there are any) is a divisor of the order of the group \(|G|\). When \(G\) is abelian and all its Sylow subgroups are elementary this is equivalent to the arithmetic condition \(f(n)\mid n\), where \(n=|G|\) and \(f(n)=\prod_{p^a\| n} (p^a-1)\). All known examples of \(n>6\) for which \(f(n)\mid n\) satisfy \(f(n)=2n\). In the joint paper of \textit{K. Ford} et al. [Mosc. J. Comb. Number Theory 2, No. 4, 3--18 (2012; Zbl 1295.11100)], it was shown that if \(n>2\) and \(f(n)\mid n\), then \(3\mid n\) and \(f(n)/n\le 85\). In the paper under review the bound \(85\) is improved to \(83\). This improvement is due mainly to an improvement on explicit sieve upper bounds for shifted primes of a result of \textit{K. Ford} [Period. Math. Hung. 43, No. 1--2, 15--29 (2001; Zbl 0980.11004)] (Theorem 1 in the paper), which in turn is based on \textit{E. Preissmann}'s version of the weighted sieve [Enseign. Math. (2) 30, 95--113 (1984; Zbl 0548.10031)] and better bounds on explicit averages of non-negative multiplicative functions by \textit{O. Ramaré} and \textit{P. Akhilesh} [Colloq. Math. 147, No. 2, 275--313 (2017; Zbl 1422.11199)].