Abstract
A lattice point in the plane is a point with integer coordinates. A lattice polygon K is a polygon whose vertices are lattice points. In this note we prove that any convex lattice 11-gon contains at least 15 interior lattice points.
Similar content being viewed by others
References
Kolodziejczyk, K., Olszewska, D.: On some conjecture by Rabinowitz. Ars Comb. 79, 171–188 (2006)
Scott, P.R.: On convex lattice polygons. Bull. Aust. Math. Soc. 15, 395–399 (1976)
Ding, R., Kolodziejczyk, K., Murphy, G., Reay, J.R.: A fast Pick-type approximation for areas of H-polygons. Am. Math. Mon. 100, 669–673 (1993)
Kolodziejczyk, K.: Hex-triangles with one interior H-point. Ars Comb. 70, 33–45 (2004)
Rabinowitz, S.: On the number of lattice points inside a convex lattice n-gon. Congr. Numer. 73, 99–124 (1990)
Ding, R., Reay, J.R., Zhang, J.: Areas of generalized H-polygons. J. Comb. Theory Ser. A 2, 304–317 (1997)
Olszewska, D.: On the first unknown value of the function of g(v). Electr. Notes Discrete Math. 24, 181–185 (2006)
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was supported by National Natural Science Foundation of China (10571042), NSF of Hebei (A2005000144) and the SF of Hebei Normal University (L2004202).
Rights and permissions
About this article
Cite this article
Wei, X., Ding, R. On the interior lattice points of convex lattice 11-gon. J. Appl. Math. Comput. 30, 193–199 (2009). https://doi.org/10.1007/s12190-008-0166-9
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12190-008-0166-9