English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

An equilateral triangle cannot be dissected into finitely many mutuallyincongruent equilateral triangles [Tutte 1948]. Therefore Tuza [Tuza 1991]asked for the largest number $s=s(n)$ such that there is a tiling of anequilateral triangle by $n$ equilateral triangles of $s(n)$ different sizes. Wesolve that problem completely and consider the analogous questions fordissections 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 twotiles are translates of each other.

Tilings of convex polygons by equilateral triangles of many different sizes