We provide almost tight bounds on the minimum and maximum possible numbers of compositions of two polycubes of given total size, in two and higher dimensions. In the plane, we reach a near-quadratic number of compositions. We also provide an efficient algorithm (with some trade-off between time and space) for computing the number of composition of two given polyominoes (or polycubes).
Last update: October 27, 2021.