No CrossRef data available.
Published online by Cambridge University Press: 01 July 2009
Given a system of diagonal forms over ℚp, we ask how many variables are required to guarantee that the system has a nontrivial zero. We show that if the prime p satisfies p > (largest degree) − (smallest degree) + 1, then there is a bound on the sufficient number of variables which is a polynomial in the degrees of the forms.