Partition problems in high dimensional boxes
From MaRDI portal
Publication:2000653
DOI10.1016/J.JCTA.2019.02.011zbMATH Open1416.05038arXiv1805.11278OpenAlexW2805465766WikidataQ128169269 ScholiaQ128169269MaRDI QIDQ2000653FDOQ2000653
Bernard Lidický, Adam Zsolt Wagner, Matija Bucić, Jason Long
Publication date: 28 June 2019
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Abstract: Alon, Bohman, Holzman and Kleitman proved that any partition of a -dimensional discrete box into proper sub-boxes must consist of at least sub-boxes. Recently, Leader, Mili'{c}evi'{c} and Tan considered the question of how many odd-sized proper boxes are needed to partition a -dimensional box of odd size, and they asked whether the trivial construction consisting of boxes is best possible. We show that approximately boxes are enough, and consider some natural generalisations.
Full work available at URL: https://arxiv.org/abs/1805.11278
Cites Work
- Title not available (Why is that?)
- Finite algebras of finite complexity
- Minimal partitions of a box into boxes
- Polyboxes, cube tilings and rigidity
- On partitions of discrete boxes
- Decomposing the complete \(r\)-graph
- On Partitions of a Rectangle into Rectangles with Restricted Number of Cross Sections
- Kleitman and combinatorics
Cited In (7)
- On partitions of discrete boxes
- Erdős-Szekeres theorem for multidimensional arrays
- Title not available (Why is that?)
- Brick partition problems in three dimensions
- On partitions of two-dimensional discrete boxes
- Box-bisection for solving second-degree systems and the problem of clustering
- Title not available (Why is that?)
Uses Software
This page was built for publication: Partition problems in high dimensional boxes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2000653)
