Counting integral points in thin sets of type II: singularities, sieves, and stratification

Abstract

Consider an absolutely irreducible polynomial F(Y,X1,…,Xn) ∈ Z[Y,X1,…,Xn] that is monic in Y and is a polynomial in Ym for an integer m ≥ 1. Let N(F,B) count the number of x ∈ [-B,B]n Zn such that F(y,x)=0 is solvable for y ∈Z. In nomenclature of Serre, bounding N(F,B) corresponds to counting integral points in an affine thin set of type II. Previously, in this generality Serre proved N(F,B) F Bn-1/2( B)γ for some γ<1. When m ≥ 2, this new work proves N(F,B) n,F,ε Bn-1+1/(n+1) + ε under a nondegeneracy condition that encapsulates that F(Y,X) is truly a polynomial in n+1 variables, even after performing any GLn(Q) change of variables on X1,…,Xn. Under GRH, this result also holds when m=1. We show that generic polynomials satisfy the relevant nondegeneracy condition. Moreover, for a certain class of polynomials, we prove the stronger bound N(F,B) F Bn-1( B)e(n), comparable to a conjecture of Serre. A key strength of these results is that they require no nonsingularity property of F(Y,X). The Katz-Laumon stratification for character sums, in a new uniform formulation appearing in a companion paper of Bonolis, Kowalski and Woo, is a key ingredient in the sieve method we develop to prove upper bounds that explicitly control any dependence on the size of the coefficients of F.

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…