Polynomial Bounds for Birch's Theorem

Abstract

Let K be a number field and f1,…,fs∈ K[x1,…,xn] forms of odd degrees. In 1957, Birch proved that if n is sufficiently large then the forms always have a nontrivial zero in Kn. Apart from some small degrees, the number of variables required was so large that it has been described as "not even astronomical". We prove that, for any fixed degree, n may be taken polynomial in s. We deduce this from a stronger result -- the Zariski closure of the set of rational zeros has codimension bounded by a polynomial in s. When K is totally imaginary, our results hold for forms of any (possibly even) degrees.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…