Saved in:
Bibliographic Details
Main Authors: Aichinger, Erhard, Schmitt, John R., Zhan, Henry
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2506.15281
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913899854430208
author Aichinger, Erhard
Schmitt, John R.
Zhan, Henry
author_facet Aichinger, Erhard
Schmitt, John R.
Zhan, Henry
contents 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ł Lasoń (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ätze for punctured grids, which are sets of the form $X \setminus Y$ with both $X,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üredi to punctured grids.
format Preprint
id arxiv_https___arxiv_org_abs_2506_15281
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Structured and Punctured Nullstellensätze
Aichinger, Erhard
Schmitt, John R.
Zhan, Henry
Combinatorics
Commutative Algebra
13B25, 11T06, 05D40
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ł Lasoń (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ätze for punctured grids, which are sets of the form $X \setminus Y$ with both $X,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üredi to punctured grids.
title Structured and Punctured Nullstellensätze
topic Combinatorics
Commutative Algebra
13B25, 11T06, 05D40
url https://arxiv.org/abs/2506.15281