On the Number of Compositions of Two Polycubes

Authors

  • Andrei Asinowski Alpen-Adria-Universität Klagenfurt
  • Gill Barequet Technion -- Israel Inst. of Technology
  • Gil Ben-Shachar Technion -- Israel Inst. of Technology
  • Martha Carolina Osegueda Univ. of California, Irvine
  • Günter Rote Freie Universität Berlin

DOI:

https://doi.org/10.57717/cgt.v3i1.41

Abstract

A composition of two polycubes is appending them to each other so that the union is a valid polycube. We provide almost tight (up to subpolynomial factors) bounds on the minimum and maximum possible numbers of compositions of two polycubes, either when each is of size n, or when their total size is N, in two and higher dimensions. We also provide an efficient algorithm for computing the number of compositions that two given polyominoes (or polycubes) have.

 

Downloads

Published

2024-06-18

How to Cite

Asinowski, A., Barequet, G., Ben-Shachar, G., Osegueda, M. C., & Rote, G. (2024). On the Number of Compositions of Two Polycubes. Computing in Geometry and Topology, 3(1), 4:1–4:18. https://doi.org/10.57717/cgt.v3i1.41

Issue

Section

Original Research Articles

Categories