Ruppert’s conjecture on small defining polynomials
For every positive integer , there exists a constant such that every number field of degree and absolute discriminant has an element with whose monic minimal polynomial satisfies for every .
References
- The existence of small defining polynomials for number fields — arXiv — Manjul Bhargava, Sameera Vemulapalli
Source: arXiv
Progress summary
The conjecture remains open in general: substantial classes are known, but no independently assessed proof of the remaining complex cases was found.
Ruppert’s conjecture asks whether every number field has a defining polynomial whose size is bounded uniformly by a power of its discriminant. Ruppert posed the question in 1998; the unresolved cases are principally totally complex fields.
Known results
- Degree : proved by Ruppert.
- Totally real fields of prime degree: proved by Ruppert.
- Fields with at least one real embedding: proved by Vaaler and Widmer.
- Abelian fields of sufficiently large degree, apart from finitely many exceptions: bounded by ; the exponent is sharp for even .
Current status (as of October 2026): The conjecture is established for several important classes, but the general case, including the remaining totally complex cases, remains open.
Solutions 0
No solutions have been posted yet.