[Paper Review] An inequality detecting nilpotency of finite groups

Tom De Medts, Marius Tărnăuceanu|arXiv (Cornell University)|Jul 4, 2012

graph theory and CDMA systems3 references3 citations

TL;DR

This paper presents a group-theoretic inequality based solely on element orders in finite groups, proving that equality holds if and only if the group is nilpotent. The result offers a new, order-based criterion to detect nilpotency without requiring subgroup or commutator analysis.

ABSTRACT

In this short note, we provide an inequality that holds in any finite group, only involving the orders of the elements; we prove that equality holds if and only if the group is nilpotent.

Motivation & Objective

• To identify a condition based only on element orders that characterizes nilpotent finite groups.
• To establish a necessary and sufficient condition for nilpotency using a single inequality.
• To provide a structural criterion for nilpotency that avoids subgroup or commutator computations.
• To contribute a new, purely order-theoretic tool for finite group classification.

Proposed method

• The authors define an inequality involving the product of element orders across the group.
• They analyze the inequality in the context of finite group structure, particularly focusing on Sylow subgroups.
• Using properties of element orders in nilpotent groups, they show equality holds precisely when the group is nilpotent.
• The proof relies on the fact that in nilpotent groups, all Sylow subgroups are normal and elements of coprime orders commute.
• They compare the inequality's behavior in nilpotent versus non-nilpotent groups to establish the characterization.
• The method avoids deep group ring or cohomological tools, relying instead on elementary order arithmetic and group structure.

Experimental results

Research questions

• RQ1 Under what conditions does the inequality based on element orders achieve equality in finite groups?
• RQ2 Can nilpotency be detected using only the orders of elements and their products?
• RQ3 Is there a structural property of finite groups that is equivalent to equality in this order-based inequality?
• RQ4 How do the element orders in non-nilpotent groups differ from those in nilpotent groups in terms of this inequality?
• RQ5 Does the inequality provide a necessary and sufficient condition for nilpotency in all finite groups?

Key findings

• The inequality holds for all finite groups, with equality if and only if the group is nilpotent.
• The characterization depends exclusively on the multiset of element orders, not on subgroup or commutator structure.
• In nilpotent groups, the product of element orders satisfies the equality condition due to the direct product structure of Sylow subgroups.
• In non-nilpotent groups, the inequality is strict, reflecting the failure of Sylow subgroups to be normal.
• The result provides a new, purely order-theoretic invariant for detecting nilpotency in finite groups.
• The inequality serves as a necessary and sufficient condition for nilpotency, offering a novel algebraic criterion.