\(H\)-triangles with \(k\) interior \(H\)-points (Q998338)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5499744
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(H\)-triangles with \(k\) interior \(H\)-points |
scientific article; zbMATH DE number 5499744 |
Statements
\(H\)-triangles with \(k\) interior \(H\)-points (English)
0 references
28 January 2009
0 references
An \(H\)-point is defined to be a vertex of a regular hexagonal tiling of the plane. An \(H\)-triangle is defined to be a triangle whose vertices are \(H\)-points. It is shown that the number of boundary \(H\)-points of an \(H\)-triangle with exactly \(k\) interior \(H\)-points is at most \(3k+7\), and not equal to \(3k+6\). It is conjectured that all other values from \(3\) to \(3k+5\) can occur. It is also conjectured that for any convex polygon with \(v\) vertices, all of them \(H\)-points, the inequality \(b\leq 3i-v+10\) holds, where \(b\) denotes the the number of boundary \(H\)-points, and \(i\) the number of interior \(H\)-points.
0 references
hexagonal tile
0 references
\(H\)-point
0 references
\(H\)-triangle
0 references
triangular lattice
0 references
Pick's theorem
0 references
0.9623147249221802
0 references
0.9577597379684448
0 references
0.9509868621826172
0 references
0.8786637783050537
0 references
