Polynomials vanishing at lattice points in a convex set

Abstract

Let P be a bounded convex subset of Rn of positive volume. Denote the smallest degree of a polynomial p(X1,…,Xn) vanishing on P Zn by rP and denote the smallest number u≥0 such that every function on P Zn can be interpolated by a polynomial of degree at most u by sP. We show that the values (rd· P-1)/d and sd· P/d for dilates d· P converge from below to some numbers vP,wP>0 as d goes to infinity. The limits satisfy vPn-1wP ≤ n!·vol(P). When P is a triangle in the plane, we show equality: vPwP = 2vol(P). These results are obtained by looking at the set of standard monomials of the vanishing ideal of d· P Zn 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…