The minimum number of interior \(H\)-points of convex \(H\)-dodecagons (Q2191994)

Consider a tiling of \(\mathbb{R}^2\) by regular hexagons of unit edge. Let \(H\) be the set of corners of this tiling. A point of \(H\) is called an \(H\)-point. An \(H\)-polygon is a simple polygon with vertices in \(H\). For a polygon \(P\) denote by \(i_H(P)\) and \(v_H(P)\) the number of interior \(H\)-points of \(P\) and the number of \(H\)-vertices of \(P\) respectively. Consider the function \[ G(v) = \min_P\{ i_H(P) \mid v_H(P) =v\}, \] where the minimum is taken over all convex \(H\)-polygons. \textit{X.~Feng} et al. [Ars Comb. 120, 321--331 (2015; Zbl 1349.52015)] proved that \(G(v)=0\) for \(3\leq v\leq 6\), \(G(7)=G(8)=2\), \(G(9)\)=4, \(G(10)=6\). Then \textit{X. Wei} et al. [Ars Comb. 143, 193--203 (2019; Zbl 1463.52015)] obtained that \(10\leq G(11)\leq 12\). In the present paper the authors show that \(G(12)=12\).