Partition problems in high dimensional boxes

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 $d$-dimensional discrete box into proper sub-boxes must consist of at least $2^d$ 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 $d$-dimensional box of odd size, and they asked whether the trivial construction consisting of $3^d$ boxes is best possible. We show that approximately $2.93^d$ boxes are enough, and consider some natural generalisations.

Full work available at URL: https://arxiv.org/abs/1805.11278

Recommendations

• On partitions of discrete boxes
• Minimal partitions of a box into boxes
• scientific article; zbMATH DE number 487006
• Brick partition problems in three dimensions
• scientific article; zbMATH DE number 4175876

zbMATH Keywords

linear programmingpartition problemshigh dimensional boxes

Mathematics Subject Classification ID

Linear programming (90C05) Partitions of sets (05A18) Discrete geometry (52C99)

Cites Work

• 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
• Title not available (Why is that?)

Cited In (9)

• On partitions of discrete boxes
• Erdős-Szekeres theorem for multidimensional arrays
• Minimal partitions of a box into boxes
• Polychromatic Colorings of n-Dimensional Guillotine-Partitions
• 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

• Gurobi

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)