Huppert’s ρ–σ conjecture
For a finite solvable group , define and . For each positive integer , define . Huppert's - conjecture asserts that for every integer .
References
- On Huppert's ρ-σ conjecture for primes in the orders of elements — arXiv — Enrico Jabara, Thomas Michael Keller
Source: arXiv
Progress summary
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 , , and .
- Exact values recorded include , , , and .
- Related finite-group formulations include bounds such as 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 - conjecture for primes in the orders of elements claims for all and for , 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.