REVIEW
Extensions of Wilson's lemma and the Ax-Katz theorem
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Extensions of Wilson's lemma and the Ax-Katz theorem
read the original abstract
A classical result of A. Fleck states that if p is a prime, and n>0 and r are integers, then $$\sum_{k=r(mod p)}\binom {n}{k}(-1)^k=0 (mod p^{[(n-1)/(p-1)]}).$$ Recently R. M. Wilson used Fleck's congruence and Weisman's extension to present a useful lemma on polynomials modulo prime powers, and applied this lemma to reprove the Ax-Katz theorem on solutions of congruences modulo p and deduce various results on codewords in p-ary linear codes with weights. In light of the recent generalizations of Fleck's congruence given by D. Wan, and D. M. Davis and Z. W. Sun, we obtain new extensions of Wilson's lemma and the Ax-Katz theorem.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.