An exact upper bound for sums of element orders in non-cyclic finite groups
Marcel Herzog, Patrizia Longobardi, Mercede Maj

TL;DR
This paper establishes sharp upper bounds for the sum of element orders in non-cyclic finite groups, improving previous inequalities and providing new criteria related to group solvability.
Contribution
It introduces the best possible upper bounds for (G) in non-cyclic groups and derives new solvability conditions based on these bounds.
Findings
(G) rac{7}{11}(C_n) for certain groups
(G) < rac{1}{q-1}(C_n) for groups of odd order
Improved inequalities over previous results from 2009, 2014, and 2015
Abstract
Denote the sum of element orders in a finite group by and let denote the cyclic group of order . Suppose that is a non-cyclic finite group of order and is the least prime divisor of . We proved that and . The first result is best possible, since for each , odd, there exists a group of order satisfying and the second result implies that if is of odd order, then . Our results improve the inequality obtained by H. Amiri, S.M. Jafarian Amiri and I.M. Isaacs in 2009, as well as other results obtained by S.M. Jafarian Amiri and M. Amiri in 2014 and by R. Shen, G. Chen and C. Wu in 2015. Furthermore, we obtained some -based sufficient conditions for the solvability of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography · graph theory and CDMA systems
