On the Number of Compositions of Two Polycubes
DOI:
https://doi.org/10.57717/cgt.v3i1.41Abstract
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
How to Cite
License
Copyright (c) 2024 Andrei Asinowski, Gill Barequet, Gil Ben-Shachar, Martha Carolina Osegueda, Günter Rote
![Creative Commons License](http://i.creativecommons.org/l/by/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).