On the number of partitions of the hypercube ${\bf Z}_q^n$ into large subcubes
Yuriy Tarannikov

TL;DR
This paper determines the asymptotic number of ways to partition a high-dimensional hypercube into large subcubes, introducing new matrix operations and classifying fractal structures within this context.
Contribution
It provides an asymptotic formula for hypercube partitions and introduces the bang operation on star matrices, distinguishing fractals from other structures.
Findings
Number of partitions asymptotically equals n^{(q^m-1)/(q-1)}
Introduces the bang operation on star matrices
Classifies fractals as non-expandable under bang
Abstract
We prove that the number of partitions of the hypercube into subcubes of dimension each for fixed , and growing is asymptotically equal to . For the proof, we introduce the operation of the bang of a star matrix and demonstrate that any star matrix, except for a fractal, is expandable under some bang, whereas a fractal remains to be a fractal under any bang.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Graph theory and applications · Graph Labeling and Dimension Problems
