Bounds on Area Involving Lattice Size
-
Published:2023-12-15
Issue:4
Volume:30
Page:
-
ISSN:1077-8926
-
Container-title:The Electronic Journal of Combinatorics
-
language:
-
Short-container-title:Electron. J. Combin.
Abstract
The lattice size of a lattice polygon $P$ is a combinatorial invariant of $P$ that was recently introduced in relation to the problem of bounding the total degree and the bi-degree of the defining equation of an algebraic curve. In this paper, we establish sharp lower bounds on the area of plane convex bodies $P\subset\mathbb{R}^2$ that involve the lattice size of $P$. In particular, we improve bounds given by Arnold, and Bárány and Pach. We also provide a classification of minimal lattice polygons $P\subset\mathbb{R}^2$ of fixed lattice size ${\operatorname{ls_\square}}(P)$.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Lattice size in higher dimensions;Involve, a Journal of Mathematics;2024-03-15