On the minimum area of convex lattice polygons (Q1378358): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 04:08, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the minimum area of convex lattice polygons |
scientific article |
Statements
On the minimum area of convex lattice polygons (English)
0 references
19 October 1998
0 references
A convex lattice polygon is a convex polygon whose vertices are in \(\mathbb{Z}^2\). Let \(a(v)\) be the minimum area of a convex lattice polygon with \(v\) vertices. It is known that with some \(c>0\) \[ cv^{2.5}\leq a(v)\leq (15/784)^3 +o(v^3). \] The author improves the lower bound to \((1/1152) v^3+O (v^2)\leq a(v)\).
0 references
lattice points
0 references
convex lattice polygon
0 references
