An F-polygon is a simple polygon whose vertices are F-points, which are points of the set of vertices of a tiling of R~2 by regular triangles and regular hexagons of unit edge. Let f(v) denote the least possible numbe...An F-polygon is a simple polygon whose vertices are F-points, which are points of the set of vertices of a tiling of R~2 by regular triangles and regular hexagons of unit edge. Let f(v) denote the least possible number of F-points in the interior of a convex F-polygon K with v vertices. In this paper we prove that f(10) = 10, f(11) = 12,f(12) = 12.展开更多
基金Supported by National Natural Science Foundation of China(Grant No.12271139)。
文摘An F-polygon is a simple polygon whose vertices are F-points, which are points of the set of vertices of a tiling of R~2 by regular triangles and regular hexagons of unit edge. Let f(v) denote the least possible number of F-points in the interior of a convex F-polygon K with v vertices. In this paper we prove that f(10) = 10, f(11) = 12,f(12) = 12.
