Let Fq be a finite field of characteristic p and order q. The Chevalley-Warning Theorem asserts that the set V of common zeros of a collection of polynomials must satisfy |V|equivalent to 0<mml:mspace width="3.33333pt"></mml:mspace>mod<mml:mspace width="0.277778em"></mml:mspace>p, provided the number of variables is sufficiently large with respect to the degrees of the polynomials. The Ax-Katz Theorem generalizes this by giving tight bounds for higher order p-divisibility for |V|. Besides the intrinsic algebraic interest of these results, they are also important tools in the Polynomial Method, particularly in the prime field case Fp, where they have been used to prove many results in Combinatorial Number Theory. In this paper, we begin by explaining how arguments used by 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 Ax-Katz Theorem for Fp, and thus also the Chevalley-Warning Theorem, where we allow varying prime power moduli. Given any box B=I1x...xIn, with each Ij subset of Z a complete system of residues modulo p, and a collection of nonzero polynomials f1,...,fs is an element of Z[X1,...,Xn], then the set of common zeros inside the box, <disp-formula id="Equ44"><mml:mtable><mml:mtr><mml:mtd columnalign="right">V={a is an element of B:<mml:mspace width="0.277778em"></mml:mspace>f1(a)equivalent to 0<mml:mspace width="3.33333pt"></mml:mspace>mod<mml:mspace width="0.277778em"></mml:mspace>pm1,...,fs(a)equivalent to 0<mml:mspace width="3.33333pt"></mml:mspace>mod<mml:mspace width="0.277778em"></mml:mspace>pms},</mml:mtd></mml:mtr></mml:mtable><graphic position="anchor" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="493_2023_57_Article_Equ44.gif"></graphic></disp-formula>satisfies |V|equivalent to 0<mml:mspace width="3.33333pt"></mml:mspace>mod<mml:mspace width="0.277778em"></mml:mspace>pm, provided n>(m-1)maxi is an element of [1,s]{pmi-1degfi}+Sigma i=1s</mml:msubsup><mml:mfrac>pmi-1p-1</mml:mfrac>degfi. The introduction of the box B adds a degree of flexibility, in comparison to prior work of 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, allows many combinatorial applications of the Chevalley-Warning and Ax-Katz Theorems, previously only valid for Fpn</mml:msubsup>, to extend with bare minimal modification to validity for an arbitrary finite abelian p-group G. We illustrate this by giving several examples, including a new proof of the exact value of the Davenport Constant D(G) for finite abelian p-groups, and a streamlined proof of the Kemnitz Conjecture. We also derive some new results, for a finite abelian p-group G with exponent q, regarding the constant <mml:msub>skq(G), defined as the minimal integer l such that any sequence of l terms from G must contain a zero-sum subsequence of length kq. Among other results for this constant, we show that <mml:msub>skq(G)<= kq+D(G)-1 provided k><mml:mfrac>d(d-1)2</mml:mfrac> and p>d(d-1), where , answering a problem of Xiaoyu He in the affirmative by removing all dependence on p from the bound for k.
