ON THE MINIMUM AREA OF CONVEX LATTICE POLYGONS
ON THE MINIMUM AREA OF CONVEX LATTICE POLYGONS
About this item
Full title
Author / Creator
Cai, Tian-Xin and 灌天新
Publisher
Mathematical Society of the Republic of China (Taiwan)
Journal title
Language
English
Formats
Publication information
Publisher
Mathematical Society of the Republic of China (Taiwan)
Subjects
More information
Scope and Contents
Contents
A convex polygon is a polygon whose vertices are points on the integer lattice with interior angles all convex. Let a(v) be the least possible area of a convex lattice polygon with v vertices. It is known that cv2.5 ≤ a(v) ≤ (15/784)v³ + o(v³). In this paper, we prove that a(v) ≥ (1/1152)v³ + O(v²).
Alternative Titles
Full title
ON THE MINIMUM AREA OF CONVEX LATTICE POLYGONS
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_crossref_primary_10_11650_twjm_1500406114
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_crossref_primary_10_11650_twjm_1500406114
Other Identifiers
ISSN
1027-5487
E-ISSN
2224-6851
DOI
10.11650/twjm/1500406114
