Covering the plane with convex polygons (Q1077728)

A system of sets \(\mathcal S=\{S_i\mid i\in I\}\) is said to be a \(k\)-fold covering of \(X\) if every element of \(X\) is contained in at least \(k\) members of \(\mathcal S\). A 1-fold covering is called simple. The author and L. Fejes Tóth conjectured that there exists an (sufficiently large) integer \(k\) such that any \(k\)-fold covering of the plane with open unit discs can be decomposed into two simple coverings. Although this conjecture has not yet been settled, the author proves: Let \(P\) be an open domain bounded by a centrosymmetric convex closed polygon. Then there exists a natural number \(k=k(P)\) such that any \(k\)-fold covering of \(\mathbb R^2\) with translates of \(P\) can be decomposed into two simple coverings. The techniques used are highly combinatorial and of independent interest. Several related results and generalizations are given. For more information on multiple coverings see: the author [Diskrete Geometrie, 2. Kolloq., Inst. Math. Univ. Salzburg 1980, 169--178 (1980; Zbl 0443.52017)], and \textit{G. Fejes Tóth} [Convexity and its Applications, Collect. Surv., 318--359 (1983; Zbl 0533.52007)]. Other relevant results and techniques are given in: \textit{J. Beck} [Combinatorica 1, 327--335 (1981; Zbl 0491.10043)], and \textit{J. Beck} and \textit{T. Fiala} [Discrete Appl. Math. 3, 1--8 (1981; Zbl 0473.05046)].