Vertex-Maximal Lattice Polytopes Contained in 2-Simplices
Abstract
Motivated by the problem of bounding the number of rays of plane tropical curves we study the following question: Given n∈N and a unimodular 2-simplex what is the maximal number of vertices a lattice polytope contained in n· can have? We determine this number for an infinite subset of N by providing a family of vertex-maximal polytopes and give bounds for the other cases.
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.