More on Decomposing Coverings by Octants
classification
🧮 math.CO
cs.DM
keywords
coveringsboundcoveringfinitelyfoldmanytranslatesabove
read the original 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 $\R^2$ by finitely many homothets or translates of a triangle. We also prove that certain dynamic interval coloring problems are equivalent to the above question.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.