Convex lattice polygons with all lattice points visible
From MaRDI portal
Publication:2219954
DOI10.1016/J.DISC.2020.112161zbMATH Open1455.52013arXiv2005.04180OpenAlexW3089243566MaRDI QIDQ2219954FDOQ2219954
Authors: Ralph Morrison, Ayush Kumar Tewari
Publication date: 21 January 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Abstract: Two lattice points are visible to one another if there exist no other lattice points on the line segment connecting them. In this paper we study convex lattice polygons that contain a lattice point such that all other lattice points in the polygon are visible from it. We completely classify such polygons, show that there are finitely many of lattice width greater than , and computationally enumerate them. As an application of this classification, we prove new obstructions to graphs arising as skeleta of tropical plane curves.
Full work available at URL: https://arxiv.org/abs/2005.04180
Recommendations
Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05) Applications of tropical geometry (14T90)
Cites Work
- polymake: a framework for analyzing convex polytopes
- \texttt{polyDB}: a database for polytopes and related objects
- Moduli of tropical plane curves
- Bounds for Lattice Polytopes Containing a Fixed Number of Interior Points in a Sublattice
- Moving out the edges of a lattice polygon
- Title not available (Why is that?)
- Embeddings and immersions of tropical curves
- Triangulations. Structures for algorithms and applications
- Riemann-Roch and Abel-Jacobi theory on a finite graph
- Toric varieties
- Graphs on surfaces
- Patterns of Visible and Nonvisible Lattice Points
- Newton polygons and curve gonalities
- On the lattice diameter of a convex polygon
- An extremal result on convex lattice polygons
Cited In (4)
Uses Software
This page was built for publication: Convex lattice polygons with all lattice points visible
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2219954)