The average element order and the number of conjugacy classes of finite groups
E. I. Khukhro, A. Moret\'o, and M. Zarrin

TL;DR
This paper investigates the average element order in finite groups, demonstrating that no polynomial lower bound exists in relation to normal subgroups' average orders, even in specific group classes, answering a previously open question.
Contribution
It provides a negative result showing the absence of polynomial bounds for average element order in finite groups, including prime-power order and abelian normal subgroups.
Findings
No polynomial lower bound for $o(G)$ in terms of $o(N)$ exists.
Counterexamples even for prime-power order groups with abelian normal subgroups.
Answers a question posed by A. Jaikin-Zapirain.
Abstract
Let be the average order of the elements of , where is a finite group. We show that there is no polynomial lower bound for in terms of , where , even when is a prime-power order group and is abelian. This gives a negative answer to a question of A.~Jaikin-Zapirain.
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
