English

Polynomials vanishing at lattice points in a convex set

Algebraic Geometry 2021-07-13 v1

Abstract

Let PP be a bounded convex subset of Rn\mathbb R^n of positive volume. Denote the smallest degree of a polynomial p(X1,,Xn)p(X_1,\dots,X_n) vanishing on PZnP\cap\mathbb Z^n by rPr_P and denote the smallest number u0u\geq0 such that every function on PZnP\cap\mathbb Z^n can be interpolated by a polynomial of degree at most uu by sPs_P. We show that the values (rdP1)/d(r_{d\cdot P}-1)/d and sdP/ds_{d\cdot P}/d for dilates dPd\cdot P converge from below to some numbers vP,wP>0v_P,w_P>0 as dd goes to infinity. The limits satisfy vPn1wPn!vol(P)v_P^{n-1}w_P \leq n!\cdot\operatorname{vol}(P). When PP is a triangle in the plane, we show equality: vPwP=2vol(P)v_Pw_P = 2\operatorname{vol}(P). These results are obtained by looking at the set of standard monomials of the vanishing ideal of dPZnd\cdot P\cap\mathbb Z^n and by applying the Bernstein--Kushnirenko theorem. Finally, we study irreducible Laurent polynomials that vanish with large multiplicity at a point. This work is inspired by questions about Seshadri constants.

Keywords

Cite

@article{arxiv.2107.05353,
  title  = {Polynomials vanishing at lattice points in a convex set},
  author = {Fabian Gundlach},
  journal= {arXiv preprint arXiv:2107.05353},
  year   = {2021}
}

Comments

25 pages, comments are welcome

R2 v1 2026-06-24T04:06:04.130Z