Convex lattice polygons with all lattice points visible
From MaRDI portal
(Redirected from Publication:2219954)
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 6437647 (Why is no real title available?)
- An extremal result on convex lattice polygons
- Bounds for Lattice Polytopes Containing a Fixed Number of Interior Points in a Sublattice
- Embeddings and immersions of tropical curves
- Graphs on surfaces
- Moduli of tropical plane curves
- Moving out the edges of a lattice polygon
- Newton polygons and curve gonalities
- On the lattice diameter of a convex polygon
- Patterns of Visible and Nonvisible Lattice Points
- Riemann-Roch and Abel-Jacobi theory on a finite graph
- Toric varieties
- Triangulations. Structures for algorithms and applications
- \texttt{polyDB}: a database for polytopes and related objects
- polymake: a framework for analyzing convex polytopes
Cited in
(4)
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)