Skip to content
DraconiticResearch
Search Sources API
182,460 studies31 sourcesUpdated 1 h ago
PreprintCC BY-NC-ND 4.0arXiv

From skew Combinatorial Nullstellensatz to sharp Ax-Katz congruences and zero counts

Abstract

We give a unified account of zero counting in finite-field polynomial rings with commuting variables twisted by a common automorphism. A decomposition into fixed-field slices connects skew evaluation with ordinary polynomial evaluation. First, we derive a slice coefficient formula from the skew Combinatorial Nullstellensatz and use it to deduce skew Chevalley-Warning, including the sufficient condition n>h∑i di. Next, classical Ax-Katz gives the corrected integer congruence Qmax{0,⌈(n−h∑i di)/D⌉}| N+(M−1)δ. We construct homogeneous examples proving optimality for every positive degree table and every number of variables. We also establish a sharp lower bound with a prescribed zero, an input-sensitive coefficient-filtration refinement, and transfers of known bounds for nonlinear zero sets. Detailed calculations explain the origin correction, incomplete norm blocks, and the distinction between characteristic-p summation and higher integer divisibility. Existing geometric, interpolation, and counting theorems are explicitly attributed.

Related

  1. Sharp effective Nullstellensatz for projective Cohen-Macaulay schemes
    Zhi Li, Xiankui Meng, Xiaoyu Su +1
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  2. Encoding-Sensitive Nullstellensatz Certificates for Syndrome Exclusion in LDPC Codes: Sharp Local Bounds and a Linear Separation
    Malihe Aliasgari, Hassan Khodaiemehr, Khadijeh Bagheri
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  3. Hiai--Petz Skew Informations and Sharp Uncertainty Relations for a Single Observable
    Gen Kimura
    arXivPreprintarXiv licenceFull textMathematical physicsQuantum physics & quantum informationarXiv
  4. Sharp Summability on Supports of Prescribed Combinatorial Dimension
    Anderson Barbosa, Daniel Pellegrino, Anselmo Raposo Jr +1
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  5. Hilbert's Nullstellensatz and the real Nullstellensatz for modules and sheaves
    Jakob Cimprič
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
BibTeX
@misc{li2026from,
  title = {{From skew Combinatorial Nullstellensatz to sharp Ax-Katz congruences and zero counts}},
  author = {Shuang Li and Xuan Pang and Pingzhi Yuan},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.35739},
  eprint = {2610.35739},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.35739},
  note = {CC BY-NC-ND 4.0},
}
RIS
TY  - UNPB
TI  - From skew Combinatorial Nullstellensatz to sharp Ax-Katz congruences and zero counts
AU  - Shuang Li
AU  - Xuan Pang
AU  - Pingzhi Yuan
PY  - 2026
DA  - 2026/10/26
PB  - arXiv
DO  - 10.48550/arxiv.2610.35739
UR  - https://arxiv.org/abs/2610.35739
AB  - We give a unified account of zero counting in finite-field polynomial rings with commuting variables twisted by a common automorphism. A decomposition into fixed-field slices connects skew evaluation with ordinary polynomial evaluation. First, we derive a slice coefficient formula from the skew Combinatorial Nullstellensatz and use it to deduce skew Chevalley-Warning, including the sufficient condition n>h∑_i d_i. Next, classical Ax-Katz gives the corrected integer congruence Q^max{0,⌈(n−h∑_i d_i)/D⌉}| N+(M−1)δ. We construct homogeneous examples proving optimality for every positive degree table and every number of variables. We also establish a sharp lower bound with a prescribed zero, an input-sensitive coefficient-filtration refinement, and transfers of known bounds for nonlinear zero sets. Detailed calculations explain the origin correction, incomplete norm blocks, and the distinction between characteristic-p summation and higher integer divisibility. Existing geometric, interpolation, and counting theorems are explicitly attributed.
ER  -