Partition problems in high dimensional boxesarxiv
Publication VersionSubmitted Manuscript
Alon, Bohman, Holzman and Kleitman proved that any partition of a d-dimensional discrete box into proper sub-boxes must consist of at least 2d sub-boxes. Recently, Leader, Milicevic and Tan considered the question of how many odd-sized proper boxes are needed to partition a d-dimensional box of odd size, and they asked whether the trivial construction consisting of 3d boxes is best possible. We show that approximately 2.93d boxes are enough, and consider some natural generalisations.
Copyright OwnerThe Authors
Citation InformationMatija Bucic, Bernard Lidicky, Jason Long and Adam Zsolt Wagner. "Partition problems in high dimensional boxes" arxiv (2018)
Available at: http://works.bepress.com/bernard-lidicky/50/
This is a manuscript made available through arxiv: https://arxiv.org/abs/1805.11278.