2000 character limit reached
Indecomposable coverings with homothetic polygons
Published 17 Dec 2013 in cs.CG, math.CO, and math.MG | (1312.4597v2)
Abstract: We prove that for any convex polygon $S$ with at least four sides, or a concave one with no parallel sides, and any $m>0$, there is an $m$-fold covering of the plane with homothetic copies of $S$ that cannot be decomposed into two coverings.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.