Tilings of convex polygons by equilateral triangles of many different sizes
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.
- Tiling convex polygons with congruent equilateral triangles
- scientific article; zbMATH DE number 3919214
- Tiling convex polygons with congruent isosceles right triangles
- Tiling by incongruent equilateral triangles without requiring local finiteness. II
- Tilings of convex polygons with congruent triangles
- An enumeration of equilateral triangle dissections
- Dissections into equilateral triangles
- scientific article; zbMATH DE number 3968590 (Why is no real title available?)
- scientific article; zbMATH DE number 3047763 (Why is no real title available?)
- Infinite perfect triangle dissections also for equilateral triangles
- The dissection of rectangles into squares
- The impossibility of a tesselation of the plane into equilateral triangles whose sidelengths are mutually different, one of them being minimal
- The Impossibility of Tiling a Convex Region with Unequal Equilateral Triangles
- Tiling by incongruent equilateral triangles without requiring local finiteness
- Tiling by incongruent equilateral triangles without requiring local finiteness. II
- Tiling the plane with equilateral triangles
- Tilings of convex sets by mutually incongruent equilateral triangles contain arbitrarily small tiles
- Unilateral and equitransitive tilings by equilateral triangles
- Unsolved problems in geometry
- Unilateral and equitransitive tilings by squares
- Tiling by incongruent equilateral triangles without requiring local finiteness. II
- Skeletal tilings of the plane into equal triangles
- Incongruent equipartitions of the plane
- Rational points of some elliptic curves related to the tilings of the equilateral triangle
- Tiling convex polygons with congruent equilateral triangles
- Tilings of convex sets by mutually incongruent equilateral triangles contain arbitrarily small tiles
- Unilateral and equitransitive tilings by squares of four sizes
- Tiling convex polygons with congruent isosceles right triangles
- Dissecting a square into congruent polygons
- scientific article; zbMATH DE number 3919214 (Why is no real title available?)
- Finite edge‐to‐edge tilings by convex polygons
- Tilings of convex polygons with congruent triangles
- Distinct equilateral triangle dissections of convex regions.
- Multiplicity of Hexagon Numbers
- An enumeration of equilateral triangle dissections
This page was built for publication: Tilings of convex polygons by equilateral triangles of many different sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2286607)
