2000 character limit reached
More on Decomposing Coverings by Octants
Published 5 Mar 2015 in math.CO and cs.DM | (1503.01669v2)
Abstract: In this note we improve our upper bound given earlier by showing that every 9-fold covering of a point set in the space by finitely many translates of an octant decomposes into two coverings, and our lower bound by a construction for a 4-fold covering that does not decompose into two coverings. The same bounds also hold for coverings of points in $\R2$ by finitely many homothets or translates of a triangle. We also prove that certain dynamic interval coloring problems are equivalent to the above question.
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.