A Generalization of the Chevalley-Warning and Ax-Katz Theorems with a View Towards Combinatorial Number Theory
Abstract
We begin by explaining how arguments used by R. Wilson to give an elementary proof of the Fp case for the Ax-Katz Theorem can also be used to prove the following generalization of the Chevalley-Warning and Ax-Katz Theorems for Fp, where we allow varying prime power moduli. Given any box B= I1×…× In, with each Ij⊂eq Z a complete system of residues modulo p, and a collection of nonzero polynomials f1,…,fs∈ Z[X1,…,Xn], then the set of common zeros inside the box, V=\ a∈ B:\; f1( a) 0 pm1,…,fs( a) 0 pms\, satisfies |V| 0 pm, provided n>(m-1)i∈ [1,s]\pmi-1deg fi\+ Σi=1spmi-1p-1deg fi. The introduction of the box B adds a degree of flexibility, in comparison to prior work of Zhi-Wei Sun. Indeed, incorporating the ideas of Sun, a weighted version of the above result is given. We continue by explaining how the added flexibility, combined with an appropriate use of Hensel's Lemma to choose the complete system of residues Ij, effectively allows many combinatorial applications of the Chevalley-Warning and Ax-Katz Theorems, previously only valid for Fpn, to extend with bare minimal modification to validity for an arbitrary finite abelian p-group G. We illustrate this be giving several examples, including a new proof of the exact value of the Davenport Constant D(G) for finite abelian p-groups, a streamlined proof of the Kemnitz Conjecture, and the resolution of a problem of Xiaoyu He regarding zero-sums of length k(G) related to a conjecture of Kubertin.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.