Tilings of convex polygons by equilateral triangles of many different sizes

From MaRDI portal
Publication:2286607

DOI10.1016/J.DISC.2019.111745zbMATH Open1434.52022arXiv1903.10431OpenAlexW2993635062WikidataQ126632139 ScholiaQ126632139MaRDI QIDQ2286607FDOQ2286607


Authors: Christian Richter Edit this on Wikidata


Publication date: 22 January 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: An equilateral triangle cannot be dissected into finitely many mutually incongruent equilateral triangles [Tutte 1948]. Therefore Tuza [Tuza 1991] asked for the largest number s=s(n) such that there is a tiling of an equilateral triangle by n equilateral triangles of s(n) different sizes. We solve that problem completely and consider the analogous questions for dissections of convex k-gons into equilateral triangles, k=4,5,6. Moreover, we discuss all these questions for the subclass of tilings such that no two tiles are translates of each other.


Full work available at URL: https://arxiv.org/abs/1903.10431




Recommendations




Cites Work


Cited In (16)

Uses Software





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)