Abstract
We review previous work of (mainly) Koelman, Haase and Schicho, and Poonen and Rodriguez-Villegas on the dual operations of (i) taking the interior hull and (ii) moving out the edges of a two-dimensional lattice polygon. We show how the latter operation naturally gives rise to an algorithm for enumerating lattice polygons by their genus. We then report on an implementation of this algorithm, by means of which we produce the list of all lattice polygons (up to equivalence) whose genus is contained in {1,…,30}. In particular, we obtain the number of inequivalent lattice polygons for each of these genera. As a byproduct, we prove that the minimal possible genus for a lattice 15-gon is 45.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Arkinstall, J.: Minimal requirements for Minkowski’s theorem in the plane I. Bull. Aust. Math. Soc. 22, 259–274 (1980)
Bárány, I.: Extremal problems for convex lattice polytopes: a survey. In: Surveys on Discrete and Computational Geometry. Contemporary Mathematics, vol. 453, pp. 87–103. AMS, Providence (2008)
Bárány, I., Tokushige, N.: The minimum area of convex lattice n-gons. Combinatorica 24(2), 171–185 (2004)
Batyrev, V., Borisov, L.: Dual cones and mirror symmetry for generalized Calabi–Yau manifolds. Mirror symmetry II. AMS/IP Stud. Adv. Math. 1, 71–86 (1997)
Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system I: The user language. J. Symb. Comput. 24(3–4), 235–265 (1997)
Castryck, W., Cools, F.: Lattice polygons and curve gonalities. J. Algebr. Comb. doi:10.1007/s10801-011-0304-6
Castryck, W., Voight, J.: On nondegeneracy of curves. Algebra Number Theory 3(3), 255–281 (2009)
Coleman, D.: Stretch: a geoboard game. Math. Mag. 51, 49–54 (1978)
Di Rocco, S., Haase, C., Nill, B., Paffenholz, A.: Polyhedral adjunction theory. Preprint
Feschet, F.: The exact lattice width of planar sets and minimal arithmetical thickness. In: Combinatorial Image Analysis. Lecture Notes in Computer Science, vol. 4040, pp. 25–33 (2006)
Fulton, W.: Introduction to Toric Varieties. Annals of Mathematics Studies, vol. 131. Princeton University Press, Princeton (1993)
Haase, C., Schicho, J.: Lattice polygons and the number 2i+7. Am. Math. Mon. 116(2), 151–165 (2009)
Hille, L., Skarke, H.: Reflexive polytopes in dimension 2 and certain relations in SL2(ℤ). J. Algebra Appl. 1(2), 159–173 (2002)
Karpenkov, O.: Elementary notions of lattice trigonometry. Math. Scand. 102(2), 161–205 (2008)
Koelman, R.: The number of moduli of families of curves on toric surfaces. Ph.D. thesis, Katholieke Universiteit Nijmegen (1991)
Kołodziejczyk, K., Olszewska, D.: On some conjectures by Rabinowitz. Ars Comb. 79, 171–188 (2006)
Kołodziejczyk, K., Olszewska, D.: A proof of Coleman’s conjecture. Discrete Math. 307, 1865–1872 (2007)
Lagarias, J., Ziegler, G.: Bounds for lattice polytopes containing a fixed number of interior points in a sublattice. Can. J. Math. 43(5), 1022–1035 (1991)
Lubbes, N., Schicho, J.: Lattice polygons and families of curves on rational surfaces. J. Algebr. Comb. 34(2), 213–236 (2011)
Nill, B.: Gorenstein toric Fano varieties. Ph.D. thesis, Universität Tübingen (2005)
Oda, T.: Convex Bodies and Algebraic Geometry. Springer, Berlin (1988)
Olszewska, D.: On the first unknown value of the function g(v). Electron. Notes Discrete Math. 24, 181–185 (2006)
Poonen, B., Rodriguez-Villegas, F.: Lattice polygons and the number 12. Am. Math. Mon. 107, 238–250 (2000)
Rabinowitz, S.: On the number of lattice points inside a convex lattice n-gon. Congr. Numer. 73, 99–124 (1990)
Scott, P.: On convex lattice polygons. Bull. Aust. Math. Soc. 15, 395–399 (1976)
Simpson, R.: Convex lattice polygons of minimum area. Bull. Aust. Math. Soc. 42, 353–367 (1990)
Verbeke, S.: Roosterveelhoeken en het getal 12 (Lattice polygons and the number 12, in Dutch). Master thesis, K.U. Leuven (2010)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Castryck, W. Moving Out the Edges of a Lattice Polygon. Discrete Comput Geom 47, 496–518 (2012). https://doi.org/10.1007/s00454-011-9376-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-011-9376-2