Partition problems in high dimensional boxes
Date
2018-06-30
Authors
Major Professor
Advisor
Committee Member
Journal Title
Journal ISSN
Volume Title
Publisher
Authors
Person
Research Projects
Organizational Units
Organizational Unit
Journal Issue
Is Version Of
Versions
Series
Department
Mathematics
Abstract
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.
Comments
This is a manuscript made available through arxiv: https://arxiv.org/abs/1805.11278.
Description
Keywords
Citation
DOI
Source
Copyright
Mon Jan 01 00:00:00 UTC 2018