Abstract
Abstract Denote by Qd the d-dimensional hypercube. We estimate the number of ways the vertex set of Qd can be partitioned into vertex disjoint smaller cubes. Among other results, we prove that the asymptotic order of this function is larger than the number of perfect matchings of Qd by an exponential factor in the number of vertices, and not by a larger factor. We also describe and address several new (and old) related questions.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 109-122 |
| Number of pages | 14 |
| Journal | Illinois Journal of Mathematics |
| Volume | 69 |
| Issue number | 1 |
| DOIs | |
| State | Published - Apr 2025 |
All Science Journal Classification (ASJC) codes
- General Mathematics
Fingerprint
Dive into the research topics of 'Partitioning the hypercube into smaller hypercubes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver