The perimeter of optimal convex lattice polygons in the sense of different metrics (Q2721592)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The perimeter of optimal convex lattice polygons in the sense of different metrics |
scientific article; zbMATH DE number 1616263
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The perimeter of optimal convex lattice polygons in the sense of different metrics |
scientific article; zbMATH DE number 1616263 |
Statements
10 July 2001
0 references
convex lattice polygon
0 references
lattice points
0 references
perimeter
0 references
0 references
The perimeter of optimal convex lattice polygons in the sense of different metrics (English)
0 references
A classical problem in analytic geometry of numbers is to minimize the perimeter of a convex lattice polygon with respect to its number of vertices, or to maximize the number of lattice points on a strictly convex curve. NEWLINENEWLINENEWLINEThe author introduces a series of metrics and gives asymptotic bounds for the perimeter of convex lattice polygons in terms of the vertex numbers.
0 references
