We present various facts on the graded Betti table of a projectively embedded toric surface, expressed in terms of the combinatorics of its defining lattice polygon. These facts include explicit formulas for a number of entries, as well as a lower bound on the length of the linear strand that we conjecture to be sharp (and prove to be so in several special cases). We also present an algorithm for determining the graded Betti table of a given toric surface by explicitly computing its Koszul cohomology, and report on an implementation in SageMath. It works well for ambient projective spaces of dimension up to roughly 25, depending on the concrete combinatorics, although the current implementation runs in finite characteristic only. As a main application we obtain the graded Betti table of the Veronese surface ν 6 (P 2 ) ⊆ P 27 in characteristic 40 009. This allows us to formulate precise conjectures predicting what certain entries look like in the case of an arbitrary Veronese surface ν d (P 2 ).

No abstract

We classify the unimodular equivalence classes of inclusion-minimal polygons with a certain fixed lattice width. As a corollary, we find a sharp upper bound on the number of lattice points of these minimal polygons.

We prove an explicit formula for the first non-zero entry in the n-th row of the graded Betti table of an n-dimensional projective toric variety associated to a normal polytope with at least one interior lattice point. This applies to Veronese embeddings of P n . We also prove an explicit formula for the entire n-th row when the interior of the polytope is onedimensional. All results are valid over an arbitrary field k.