Tilings of convex polygons by equilateral triangles of many different sizes (Q2286607): Difference between revisions

Let \(P\) be a convex polygon. Then \(P\) admits a tiling by equilateral triangles if and only \(P\) is one of the following polygons \begin{itemize} \item[a)] equilateral triangle; \item[b)] trapezoid with angles \(\frac{\pi}{3}\), \(\frac{\pi}{3}\), \(\frac{2\pi}{3}\) and \(\frac{2\pi}{3}\); \item[c)] parallelogramm with angles \(\frac{\pi}{3}\), \(\frac{2\pi}{3}\), \(\frac{\pi}{3}\), \(\frac{2\pi}{3}\); \item[d)] pentagon with angles \(\frac{\pi}{3}\), \(\frac{2\pi}{3}\), \(\frac{2\pi}{3}\), \(\frac{2\pi}{3}\), \(\frac{2\pi}{3}\); \item[e)] hexagon with angles \(\frac{2\pi}{3}\). \end{itemize} For each of this cases denote by \(dom(s_P)\) the set of \(n\)'s such that there exists a tiling of \(P\) by \(n\) equilateral triangles. For \(n\in dom(s_P)\) also denote by \(s_P(n)\) the largest number \(s\) such that there exists a tiling of \(P\) by \(n\) equilateral triangles of \(s\) different sizes. Then exact formulas for \(dom(s_P)\) in cases a)--e) and for \(s_P(n)\) in cases a)--d) are proved. For \(s_{hex}(n)\) (case e)) it is proved that \(n-5\leq s_{hex}(n)\leq n-4\). Further, we can consider so called \(t\)-perfect tilings where no two tiles are translates of each other and study \(dom(s_P^{t-perf})\) and \(s_P^{t-perf}(n)\) (\(t\)-perfect analogues of \(dom(s_P)\) and \(s_P(n)\). Then exact formulas or estimates of these values in cases a)--e) are obtained.