Autor:	Andrei Asinowski, Gill Barequet, Gil Ben-Shachar, Martha Carolina Osegueda, Günter Rote
Rok vydání:	2021
Předmět:	Combinatorics Polyomino Efficient algorithm Composition (combinatorics) Mathematics
Zdroj:	Trends in Mathematics ISBN: 9783030838225
Popis:	We provide almost tight 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 2n, in two and higher dimensions. We also provide an efficient algorithm (with some trade-off between time and space) for computing the number of composition two given polyominoes (or polycubes) have.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::c214a69763a1632dabb41e5445d18464 https://doi.org/10.1007/978-3-030-83823-2_12 Zobrazit plný text záznamu