no code implementations • 20 Jan 2021 • Ilkyoo Choi, Minseong Kim, Kiwon Seo
As a generalization of the above question, we also seek the minimum size $s(d, k)$ of a brick partition $\mathcal{P}_d$ of a $d$-dimensional brick where each axis-parallel plane intersects at least $k$ bricks in $\mathcal{P}_d$.
Combinatorics