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 Edit this on Wikidata


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 2, 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




Cites Work


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)