← All problems

Huppert’s ρ–σ conjecture

For a finite solvable group GG, define ρ(G)=∣{p prime:p∣∣G∣}∣\rho(G)=|\{p\text{ prime}:p\mid |G|\}| and σ(G)=max⁡{∣{p prime:p∣∣g∣}∣:g∈G}\sigma(G)=\max\{|\{p\text{ prime}:p\mid |g|\}|:g\in G\}. For each positive integer nn, define ρ(n)=max⁡{ρ(G):G is finite solvable and σ(G)=n}\rho(n)=\max\{\rho(G):G\text{ is finite solvable and }\sigma(G)=n\}. Huppert's ρ\rho-σ\sigma conjecture asserts that ρ(n)=3n\rho(n)=3n for every integer n≥4n\ge 4.

References

Source: arXiv

Progress summary

Refreshed
Open · progress reported

A new unrefereed preprint narrows the gap around Huppert’s conjecture, but does not prove the predicted equality.

Huppert’s conjecture predicts an asymptotic equality for the function measuring how many primes can occur in element orders of finite groups. The latest work establishes one inequality and improves the opposite bound, leaving equality unresolved.

Known results

  • Earlier bounds include ρ(n)≥2n\rho(n)\ge 2n, ρ(n+1)≤ρ(n)+n+2\rho(n+1)\le \rho(n)+n+2, and ρ(n)≤n(n+3)/2−2\rho(n)\le n(n+3)/2-2.
  • Exact values recorded include ρ(1)=2\rho(1)=2, ρ(2)=5\rho(2)=5, ρ(3)=8\rho(3)=8, and ρ(4)=12\rho(4)=12.
  • Related finite-group formulations include bounds such as ∣ρ(G)∣≤3σ(G)|\rho(G)|\le 3\sigma(G) in several restricted classes, but do not settle this asymptotic problem.

October 2026 bounds

Enrico Jabara and Thomas Michael Keller’s preprint On Huppert's ρ\rho-σ\sigma conjecture for primes in the orders of elements claims ρ(n)≥3n\rho(n)\ge 3n for all n≥4n\ge 4 and ρ(n)≤9n/2\rho(n)\le 9n/2 for n≥58n\ge 58, narrowing the gap without using the classification of finite simple groups. The preprint is unrefereed, so these advances remain unverified.

Current status (as of October 2026): The conjectured equality remains open; the new bounds are claimed progress from an unrefereed preprint.

Sources

Solutions 0

No solutions have been posted yet.