<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
         xmlns:dc="http://purl.org/dc/terms/"
         xmlns:foaf="http://xmlns.com/foaf/0.1/"
         xmlns:bibo="http://purl.org/ontology/bibo/"
         xmlns:fabio="http://purl.org/spar/fabio/"
         xmlns:owl="http://www.w3.org/2002/07/owl#"
         xmlns:event="http://purl.org/NET/c4dm/event.owl#"
         xmlns:ore="http://www.openarchives.org/ore/terms/">

    <rdf:Description rdf:about="https://ris.uni-paderborn.de/record/53420">
        <ore:isDescribedBy rdf:resource="https://ris.uni-paderborn.de/record/53420"/>
        <dc:title>Polynomials vanishing at lattice points in a convex set</dc:title>
        <bibo:authorList rdf:parseType="Collection">
            <foaf:Person>
                <foaf:name></foaf:name>
                <foaf:surname></foaf:surname>
                <foaf:givenname></foaf:givenname>
            </foaf:Person>
        </bibo:authorList>
        <bibo:abstract>Let $P$ be a bounded convex subset of $\mathbb R^n$ of positive volume.
Denote the smallest degree of a polynomial $p(X_1,\dots,X_n)$ vanishing on
$P\cap\mathbb Z^n$ by $r_P$ and denote the smallest number $u\geq0$ such that
every function on $P\cap\mathbb Z^n$ can be interpolated by a polynomial of
degree at most $u$ by $s_P$. We show that the values $(r_{d\cdot P}-1)/d$ and
$s_{d\cdot P}/d$ for dilates $d\cdot P$ converge from below to some numbers
$v_P,w_P&gt;0$ as $d$ goes to infinity. The limits satisfy $v_P^{n-1}w_P \leq
n!\cdot\operatorname{vol}(P)$. When $P$ is a triangle in the plane, we show
equality: $v_Pw_P = 2\operatorname{vol}(P)$. These results are obtained by
looking at the set of standard monomials of the vanishing ideal of $d\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.</bibo:abstract>
    </rdf:Description>
</rdf:RDF>
