Dissectingd-Cubes into Smallerd-Cubes
β Scribed by Matthew Hudelson
- Book ID
- 102583151
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 313 KB
- Volume
- 81
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper, we explore the following question: Given integers d and k, is it possible to subdivide a d-dimensional cube into k smaller d-dimensional cubes? In particular, we investigate bounds on the integer c(d) which is the smallest integer for which it is possible to subdivide the d-cube into any number k c(d ) smaller d-cubes. We derive specific bounds for d 5, and furthermore, we investigate, for given k, the asymptotic behavior of c(d ) for those d such that gcd(2 d &1,
Finally, we derive the general asymptotic bound c(d )=O((2d) d&1 ) which improves the currently known bound of c(d )=O((2d) d ).
π SIMILAR VOLUMES
Β« Jβai passΓ© mon enfance Γ entendre des histoires le concernant. Tout le monde ici en avait une Γ raconter sur ce voisin pas comme les autres qui effectuait des tours du monde Γ bord dβimprobables machines dont il avait lui-mΓͺme conΓ§u les plans, qui sΓ©journait en orbite autour de la Terre, concourai
For a complete bipartite graph to be decomposable into isomorphic cubes, certain conditions on the number of cube and bipartition vertices must hold. We prove these necessary conditions sufficient in some cases. For cubes of fixed dimension d (indeed for d-regular bipartite graphs in general) we sho