Solubility of Systems of Quadratic Forms
Greg Martin
Abstract
We derive an upper bound for the least number of variables needed to guarantee that a system of t quadratic forms (t>=2) over a field F has a nontrivial zero. In particular, if F is a local field, then 2t2+3 variables insure the existence of a nontrivial zero (2t2+1 if t is even), while if F=Qp with p>=11, then 2t2-2t+5 variables suffice (2t2-2t+1 if 3 divides t). The improvement lies in a more efficient use of information on the solubility of pairs and triplets of quadratic forms, and the arguments are completely elementary.
Create a lesson
Related papers
An ergodic approach to equations of the form x+y=α(n)
Vitaly Bergelson, Hao Pan, Saúl Rodríguez Martín
Rogers--Ramanujan identities from the geometry of Xa=Yb
Yifeng Huang, Kenny Lau, Ken Ono
Computational results on sums of a prime with squares or cubes
Kenny Applegate, Kyle Pratt
Finding New Limit Points of Mahler Measure by Methods of Missing Data Restoration
Jean-Marc Sac-Épée, Souad El Otmani, Armand Maul et al.
Low moments of automorphic random multiplicative function sums
Sun-Kai Leung
A problem of Yang and Chen on weighted representation functions
Shuang-Shuang Li, Ya-Ting Xu, Xiao-Hui Yan