← All problems

Ruppert’s conjecture on small defining polynomials

For every positive integer nn, there exists a constant Cn>0C_n>0 such that every number field KK of degree nn and absolute discriminant D=∣Disc⁡(K)∣D=|\operatorname{Disc}(K)| has an element α∈K\alpha\in K with K=Q(α)K=\mathbb{Q}(\alpha) whose monic minimal polynomial f(x)=xn+an−1xn−1+⋯+a0∈Z[x]f(x)=x^n+a_{n-1}x^{n-1}+\cdots+a_0\in\mathbb{Z}[x] satisfies ∣ai∣≤CnD|a_i|\le C_n\sqrt{D} for every 0≤i<n0\le i<n.

References

Source: arXiv

Progress summary

Refreshed
Open

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 22: 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 (25∣ΔK∣)1/(2d)(25|\Delta_K|)^{1/(2d)}; the exponent is sharp for even dd.

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.

Sources

Solutions 0

No solutions have been posted yet.