Papers
Topics
Authors
Recent
Search
2000 character limit reached

Baniasad Azad & Khosravi Supersolubility Criterion

Updated 23 January 2026
  • The paper introduces a supersolubility criterion based on the normalized sum of element orders, establishing that groups with ψ'(G) > 31/77 are supersoluble.
  • The methodology employs structural, arithmetic, and combinatorial techniques, including Frobenius automorphism actions and fixed-point centralizers, to analyze group properties.
  • The work provides a comprehensive classification of finite groups, distinguishing between supersoluble families and marginal cases through explicit bounds and subgroup analyses.

The supersolubility criterion of Baniasad Azad and Khosravi gives an explicit group-theoretic condition for the supersolubility of finite groups in terms of the normalized sum of element orders, as well as insights into the role of Frobenius automorphism groups and fixed-point centralizers. The criterion has been fully classified and connected to structural group properties in recent work, particularly via the bound ψ(G)>31/77\psi'(G) > 31/77, where ψ(G)\psi'(G) denotes the normalized sum of element orders for finite group GG (Iorio et al., 16 Jan 2026). The methods and conclusions also appear in the context of Frobenius automorphism actions (Tang et al., 2015), further enriching understanding of group solubility and associated invariants.

1. Definition of the Criterion

Let GG be a finite group, and define

ψ(G)=xGo(x)\psi(G) = \sum_{x \in G} o(x)

as the sum of the orders of all elements in GG, with o(x)o(x) the order of xGx \in G. The normalized sum is

ψ(G)=ψ(G)ψ(CG)\psi'(G) = \frac{\psi(G)}{\psi(\mathcal{C}_{|G|})}

where Cn\mathcal{C}_n is the cyclic group of order nn.

The Baniasad Azad–Khosravi criterion states:

If

ψ(G)>ψ(A4)=3177\psi'(G) > \psi'(A_4) = \frac{31}{77}

then GG is supersoluble (Iorio et al., 16 Jan 2026). Equivalently, A4A_4 is the minimal non-supersoluble group, and any group GG exceeding the normalized sum of A4A_4 must be supersoluble.

For groups admitting a Frobenius group of automorphisms FHFH with kernel FF and complement HH such that CG(F)=1C_G(F)=1, the supersolubility of GG follows if the centralizer CG(H)C_G(H) is supersoluble and CG(H)C_{G'}(H) (centralizer within the derived subgroup) is nilpotent (Tang et al., 2015).

2. Theoretical Background and Key Lemmas

The proof framework relies on structural, arithmetic, and combinatorial ingredients:

  • Multiplicativity: For AA and BB of coprime order, ψ(A×B)=ψ(A)ψ(B)\psi'(A \times B) = \psi'(A) \psi'(B).
  • Cyclic group formula: For n=piαin = \prod p_i^{\alpha_i},

ψ(Cn)=ipi2αi+1+1pi+1\psi(\mathcal{C}_n) = \prod_{i} \frac{p_i^{2\alpha_i+1}+1}{p_i+1}

  • Semidirect product formula: If PGP \trianglelefteq G is a cyclic Sylow subgroup and G=PHG = P \rtimes H,

ψ(G)=Pψ(H)+(ψ(P)P)ψ(CH(P))\psi(G) = |P|\psi(H) + (\psi(P)-|P|)\psi(C_H(P))

  • CyclBoundIndex: If ψ(G)>r/s\psi'(G) > r/s, there exists xx such that

G:x<srpGp+1p|G : \langle x \rangle| < \frac{s}{r} \prod_{p \mid |G|} \frac{p+1}{p}

  • Core-lemma: For cyclic A<GA < G, A:K<G:A|A:K| < |G:A| with core KK.

In the context of Frobenius group actions, essential lemmas include:

  • If CG(F)=1C_G(F) = 1 under nilpotent FF, then GG is soluble.
  • For FHFH-invariant normal NGN \trianglelefteq G, CG/N(H)=CG(H)N/NC_{G/N}(H) = C_G(H) N/N.
  • The unique FHFH-invariant Hall TT-subgroups form a system.
  • Transfer of solubility properties from CG(H)C_G(H) and CG(H)C_{G'}(H) to GG under the specified fixed-point structure.

3. Classification of Groups Satisfying the Criterion

Groups GG with ψ(G)>31/77\psi'(G) > 31/77 are precisely classified by their structure as follows (Iorio et al., 16 Jan 2026):

Family Representative Groups Condition
“Large” M-groups Cn\mathcal{C}_n, Q8Q_8, various semidirect products & their coprime cyclic extensions Always supersoluble
Extremal non-M-groups D8×CmD_8 \times \mathcal{C}_m, (C7ιC2)×Cm(\mathcal{C}_7 \rtimes_\iota \mathcal{C}_2) \times \mathcal{C}_m ψ(G)=19/43>31/77\psi'(G) = 19/43 > 31/77
Near-equality cases Q16Q_{16}, C3×C3\mathcal{C}_3 \times \mathcal{C}_3, etc. 31/77<ψ(G)<19/4331/77 < \psi'(G) < 19/43 (not supersoluble)

All supersoluble groups fall in the first category, while the extremal cases provide boundaries for the modular subgroup lattice property. Groups with normalized sums strictly between $31/77$ and $19/43$ are not supersoluble.

4. Methodology of Proof and Structural Implications

The argument proceeds via induction and reduction:

  • Lower bounds on ψ(Cn)\psi(\mathcal{C}_n) provide constraints on possible quotient indices.
  • Application of Lucchini’s core-lemma yields normal cyclic subgroups.
  • If ψ(G)>31/77\psi'(G) > 31/77, GG possesses a normal cyclic Sylow 2- or pp-subgroup (p=maxπ(G))(p = \max \pi(G)).
  • Decomposition G=PHG = P \rtimes H allows comparison of ψ(G)\psi(G) and ψ(H)\psi(H), employing the semidirect formula.
  • Case analysis on possible HH (with inductive bounds) restricts the possibilities, leading to the explicit family structure in the previous section.

For Frobenius automorphism groups, the stepwise transfer of solubility and supersolubility properties through centralizers enables the general result: if CG(H)C_G(H) is supersoluble and CG(H)C_{G'}(H) is nilpotent, then GG is supersoluble (Tang et al., 2015).

5. Equality and Sharpness

The bound ψ(G)>31/77\psi'(G) > 31/77 is optimal. The only groups with ψ(G)=31/77\psi'(G) = 31/77 are A4A_4 and its direct products with coprime cyclics. These mark the exact threshold at which supersolubility fails.

Groups lying just above $31/77$ but below $19/43$ are rare and precisely enumerated; they exhibit structures that are not supersoluble but approach the modular lattice property—Q16Q_{16}, C3×C3\mathcal{C}_3 \times \mathcal{C}_3, D12D_{12}, etc.

6. Connections to Hall Systems and Permutation Criteria

The role of normalized sum bounds is intimately connected to Hall subgroup systems—groups with NS-supplemented Sylow subgroups, where the existence of such supplements implies permuting Hall subgroups, whence pp-solubility and supersolubility by induction (Monakhov et al., 2019). The existence of a Frobenius group of automorphisms, as in (Tang et al., 2015), introduces additional control through centralizer properties and the transfer of structural characteristics from fixed-point subgroups.

A plausible implication is that normalized element order criteria, Frobenius automorphism actions, and NS-supplementation instantiate parallel approaches to characterizing supersolubility through diverse but converging invariants and subgroup permutation properties.

7. Concluding Remarks and Extensions

The supersolubility criterion of Baniasad Azad and Khosravi provides an explicit spectral bound for group supersolubility, with complete classification for groups exceeding the critical normalized sum. The framework allows for modular transfer between centralizer conditions in the presence of Frobenius automorphism groups and gives exact inclusion and exclusion criteria via explicit group families (Iorio et al., 16 Jan 2026, Tang et al., 2015). The combinatorial and permutation-based methodologies reflected in NS-supplementation and normalized sum bounds highlight a unified approach to finite group classification—in particular, those admitting strong solubility behaviors. This suggests the possibility of further refinements for related invariants and the extension to broader classes of linear or permutation groups.

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Supersolubility Criterion of Baniasad Azad and Khosravi.