Indecomposable coverings with homothetic polygons (Q2351020)

A family of sets in the Euclidean space \(\mathbb{R}^n\) is called an \(m\)-\textit{fold covering} if every point of \(\mathbb{R}^n\) is contained in at least \(m\) members of the family, a \(1\)-fold covering is called a \textit{covering}. Keszegh and Pálvölgyi proved that, for any triangle \(T\), every \(12\)-fold covering of the plane \(\mathbb{R}^2\) with homothetic copies of \(T\) can be decomposed into two coverings. The author proves the following: Let \(P\) be any convex polygon with at least four sides, or a concave polygon with no parallel sides, and let \(m>0\). Then there is an \(m\)-fold covering of the plane with homothetic copies of \(P\) that cannot be decomposed into two coverings. Furthermore, if \(P\) is convex, then for any \(\varepsilon > 0\) one may also add the condition that all homothety ratios are at least \(1-\varepsilon\) and at most \(1+\varepsilon\).