Loading [MathJax]/extensions/tex2jax.js

Vertex-Maximal Lattice Polytopes Contained in 2-Simplices

Research output: Working paper/PreprintPreprint

Authors

  • Jan-Philipp Litza
  • Christoph Pegel
  • Kirsten Schmitz

External Research Organisations

  • University of Bremen

Details

Original languageEnglish
Number of pages13
Publication statusE-pub ahead of print - 25 May 2018

Abstract

Motivated by the problem of bounding the number of rays of plane tropical curves we study the following question: Given \(n\in\mathbb{N}\) and a unimodular \(2\)-simplex \(\Delta\) what is the maximal number of vertices a lattice polytope contained in \(n\cdot \Delta\) can have? We determine this number for an infinite subset of \(\mathbb{N}\) by providing a family of vertex-maximal polytopes and give bounds for the other cases.

Keywords

    math.CO, 52B20 (Primary) 14T05 (Secondary)

Cite this

Vertex-Maximal Lattice Polytopes Contained in 2-Simplices. / Litza, Jan-Philipp; Pegel, Christoph; Schmitz, Kirsten.
2018.

Research output: Working paper/PreprintPreprint

Litza, J.-P., Pegel, C., & Schmitz, K. (2018). Vertex-Maximal Lattice Polytopes Contained in 2-Simplices. Advance online publication. https://arxiv.org/abs/1805.09989
Litza JP, Pegel C, Schmitz K. Vertex-Maximal Lattice Polytopes Contained in 2-Simplices. 2018 May 25. Epub 2018 May 25.
Litza, Jan-Philipp ; Pegel, Christoph ; Schmitz, Kirsten. / Vertex-Maximal Lattice Polytopes Contained in 2-Simplices. 2018.
Download
@techreport{61eb50bd647841f49bfbeb9e07fb346a,
title = "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\in\mathbb{N}\) and a unimodular \(2\)-simplex \(\Delta\) what is the maximal number of vertices a lattice polytope contained in \(n\cdot \Delta\) can have? We determine this number for an infinite subset of \(\mathbb{N}\) by providing a family of vertex-maximal polytopes and give bounds for the other cases. ",
keywords = "math.CO, 52B20 (Primary) 14T05 (Secondary)",
author = "Jan-Philipp Litza and Christoph Pegel and Kirsten Schmitz",
note = "13 pages, 7 figures",
year = "2018",
month = may,
day = "25",
language = "English",
type = "WorkingPaper",

}

Download

TY - UNPB

T1 - Vertex-Maximal Lattice Polytopes Contained in 2-Simplices

AU - Litza, Jan-Philipp

AU - Pegel, Christoph

AU - Schmitz, Kirsten

N1 - 13 pages, 7 figures

PY - 2018/5/25

Y1 - 2018/5/25

N2 - Motivated by the problem of bounding the number of rays of plane tropical curves we study the following question: Given \(n\in\mathbb{N}\) and a unimodular \(2\)-simplex \(\Delta\) what is the maximal number of vertices a lattice polytope contained in \(n\cdot \Delta\) can have? We determine this number for an infinite subset of \(\mathbb{N}\) by providing a family of vertex-maximal polytopes and give bounds for the other cases.

AB - Motivated by the problem of bounding the number of rays of plane tropical curves we study the following question: Given \(n\in\mathbb{N}\) and a unimodular \(2\)-simplex \(\Delta\) what is the maximal number of vertices a lattice polytope contained in \(n\cdot \Delta\) can have? We determine this number for an infinite subset of \(\mathbb{N}\) by providing a family of vertex-maximal polytopes and give bounds for the other cases.

KW - math.CO

KW - 52B20 (Primary) 14T05 (Secondary)

M3 - Preprint

BT - Vertex-Maximal Lattice Polytopes Contained in 2-Simplices

ER -