子格-自由格多边形顶点数的界
Bounds on the number of vertices of sublattice-free lattice polygons
摘要：
本文建立了几类凸子格-自由格多边形顶点数的界。边界是必不可少的证明公式的临界顶点数的格多边形，确保存在的一个子格点的多边形。利用格点折线的边数与其端点坐标之间的关系，得到了边界。
英文摘要：
In this paper we establish bounds on the number of vertices for a few classes of convex sublattice-free lattice polygons. The bounds are essential for proving the formula for the critical number of vertices of a lattice polygon that ensures the existence of a sublattice point in the polygon. To obtain the bounds, we use relations between the number of edges of lattice broken lines and the coordinates of their endpoints.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
