English

Structured and Punctured Nullstellens\"atze

Combinatorics 2025-06-19 v1 Commutative Algebra

Abstract

A Nullstellensatz is a theorem providing information on polynomials that vanish on a certain set: David Hilbert's Nullstellensatz (1893) is a cornerstone of algebraic geometry, and Noga Alon's Combinatorial Nullstellensatz (1999) is a powerful tool in the "Polynomial Method", a technique used in combinatorics. Alon's Theorem excludes that a polynomial vanishing on a grid contains a monomial with certain properties. This theorem has been generalized in several directions, two of which we will consider in detail: Terence Tao and Van H. Vu (2006), Uwe Schauz (2008) and Micha\l{} Laso\'n (2010) exclude more monomials, and recently, Bogdan Nica (2023) improved the result for grids with additional symmetries in their side edges. Simeon Ball and Oriol Serra (2009) incorporated the multiplicity of zeros and gave Nullstellens\"atze for punctured grids, which are sets of the form XYX \setminus Y with both X,YX,Y grids. We generalize some of these results; in particular, we provide a common generalization to the results of Schauz and Nica. To this end, we establish that during multivariate polynomial division, certain monomials are unaffected. This also allows us to generalize Pete L. Clark's proof of the nonzero counting theorem by Alon and F\"uredi to punctured grids.

Cite

@article{arxiv.2506.15281,
  title  = {Structured and Punctured Nullstellens\"atze},
  author = {Erhard Aichinger and John R. Schmitt and Henry Zhan},
  journal= {arXiv preprint arXiv:2506.15281},
  year   = {2025}
}
R2 v1 2026-07-01T03:23:18.436Z