2010
DOI: 10.1007/s00493-010-2448-8
|View full text |Cite
|
Sign up to set email alerts
|

Formulae and growth rates of high-dimensional polycubes

Abstract: A d-dimensional polycube is a facet-connected set of cubes in d dimensions. Fixed polycubes are considered distinct if they differ in their shape or orientation. A proper d-dimensional polycube spans all the d dimensions, that is, the convex hull of the centers of its cubes is d-dimensional. In this paper we prove rigorously some (previously conjectured) closed formulae for fixed (proper and improper) polycubes, and show that the growth-rate limit of the number of polycubes in d dimensions is 2ed − o(d). We co… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
33
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 20 publications
(48 citation statements)
references
References 19 publications
1
33
0
Order By: Relevance
“…This 1/d-expansion (of the free energy of animals, in their terminology) is partly based on so-called "diagonal formulae," that is, formulae for DX(n, n − k), where k > 0 is a small constant. It turned out that this expansion is consistent with the main result obtained by Barequet et al [2], namely, that the growth-rate limit of the number of polycubes in d dimensions is asymptotically 2ed − o(d), conjectured to asymptotically be (2d − 3)e − 31e 48d…”
Section: Introductionsupporting
confidence: 76%
See 4 more Smart Citations
“…This 1/d-expansion (of the free energy of animals, in their terminology) is partly based on so-called "diagonal formulae," that is, formulae for DX(n, n − k), where k > 0 is a small constant. It turned out that this expansion is consistent with the main result obtained by Barequet et al [2], namely, that the growth-rate limit of the number of polycubes in d dimensions is asymptotically 2ed − o(d), conjectured to asymptotically be (2d − 3)e − 31e 48d…”
Section: Introductionsupporting
confidence: 76%
“…In counting directed trees with n − 1 labeled edges, which have subgraphs as in Figure 2, two lemmas will be used. Lemma 4 was proved earlier [2]; we will here relate it to a result from the literature.…”
Section: Distinguished Structuresmentioning
confidence: 96%
See 3 more Smart Citations