2000 character limit reached
On Ehrhart polynomials of lattice triangles
Published 29 Sep 2016 in math.CO and math.AG | (1609.09526v1)
Abstract: The Ehrhart polynomial of a lattice polygon P is completely determined by the pair (b(P),i(P)) where b(P) equals the number of lattice points on the boundary and i(P) equals the number of interior lattice points. All possible pairs (b(P),i(P)) are completely described by a theorem due to Scott. In this note, we describe the shape of the set of pairs (b(T),i(T)) for lattice triangles T by finding infinitely many new Scott-type inequalities.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.