Partition problems in high dimensional boxes

DOI10.1016/j.jcta.2019.02.011zbMath1416.05038arXiv1805.11278OpenAlexW2805465766WikidataQ128169269 ScholiaQ128169269MaRDI QIDQ2000653

Bernard Lidický, Adam Zsolt Wagner, Jason Long, Matija Bucić

Publication date: 28 June 2019

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

linear programmingpartition problemshigh dimensional boxes

Mathematics Subject Classification ID

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

Related Items (3)

Brick partition problems in three dimensions ⋮ Erdős-Szekeres theorem for multidimensional arrays ⋮ On partitions of two-dimensional discrete boxes

Uses Software

• Gurobi

Cites Work

• Unnamed Item
• Minimal partitions of a box into boxes
• Polyboxes, cube tilings and rigidity
• Decomposing the complete \(r\)-graph
• Finite algebras of finite complexity
• Kleitman and combinatorics
• On partitions of discrete boxes
• On Partitions of a Rectangle into Rectangles with Restricted Number of Cross Sections

This page was built for publication: Partition problems in high dimensional boxes