The Hasse principle for homogeneous polynomials with random coefficients over thin sets
Abstract
In this paper, we investigate the solubility of homogeneous polynomial equations. The work of Browning, Le boudec, Sawin [3] shows that almost all homogeneous equations of degree d≥ 4 in d+1 or more variables satisfy the Hasse principle, and in particular that a positive portion possess a non-trivial integral solution. Our main result, when combined with our sequel joint work with H.Lee and S.Lee, shows that such a conclusion remains true even when the coefficients of homogeneous polynomials are constrained by a polynomial condition under a modest condition on the number of variables. To be precise, let d and n be natural numbers. Let d,n: Rn→ RN denote the Veronese embedding with N=n+d-1d, defined by listing all the monomials of degree d in n variables using the lexicographical ordering. Let a, d,n(x)∈ Z[x] be a homogeneous polynomial in n variables of degree d with integer coefficients a, where ·,· denotes the inner product. For a non-singular form P∈ Z[x] in N variables of degree k≥ 2, consider a set of integer vectors a∈ ZN, defined by A(A;P)=\a∈ ZN|\ P(a)=0,\ \|a\|∞≤ A\. We confirm that when d≥ 4, n is sufficiently large in terms of d, and k≤ d, the proportion of integer vectors a∈ ZN in A(A;P), whose associated equations a, d,n(x)=0 satisfy the Hasse principle, converges to 1 as A→ ∞. We make explicit a lower bound on n guaranteeing this conclusion. In particular, we show that when d≥ 14 it suffices to take n≥ 32d+17.