Hostname: page-component-78c5997874-t5tsf Total loading time: 0 Render date: 2024-11-04T20:24:11.630Z Has data issue: false hasContentIssue false
  • English
  • Français

Convex lattice polygons of minimum area

Published online by Cambridge University Press:  17 April 2009

R.J. Simpson
R.J. Simpson
Affiliation:
School of Mathematics and Statistics, Curtin University of Technology, GPO Box U1987 Perth WA 6001, Australia
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A convex lattice polygon is a polygon whose vertices are points on the integer lattice and whose interior angles are strictly less than π radians. We define a(2n) to be the least possible area of a convex lattice polygon with 2n vertices. A method for constructing convex lattice polygons with area a(2n) is described, and values of a(2n) for low n are obtained.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 42 , Issue 3 , December 1990 , pp. 353 - 367
Copyright
Copyright © Australian Mathematical Society 1990

References

[1]Arkinstall, J.R., ‘Minimal requirements for Minkowski's theorem in the plane I’, Bull. Austral. Math. Soc. 22 (1980), 259–274.CrossRefGoogle Scholar
[2]Coxeter, H.S.M., Introduction to Geometry (John Wiley and Sons, Inc, New York, 1980).Google Scholar
[3]Hardy, G.H. and Wright, E.M., An Introduction to the Theory of Numbers, Fourth Edition (Oxford, 1975).Google Scholar
[4]Rabinowitz, Stanley, Convex Lattice Polygone, Ph.D. Dissertation (Polytechnic University, Brooklyn, New York, 1986).Google Scholar
[5]Rabinowitz, Stanley, ‘On the number of lattice points inside a convex lattice n-gon’, Congr. Numer. 73 (1990), 99–124.Google Scholar