Decomposing cubes into smaller cubes
Given a positive integer \(n\), let us define \(D(n)\) as the set of integers \(k\) such that an \(n\)-dimensional cube can be decomposed into \(k\) smaller \(n\)-dimensional cubes. In addition, let \(c(n)\) be the smallest integer (it is known to exist, for example \(c(2)=6\)) such that \(k\geq c(n) \Rightarrow k\in D(n)\). This paper presents some results dealing with \(c(n)\). In particular, it is proven that \(c(n)\geq 2^{n+1}+1\) for every \(n\geq 3\) and also that \(c(n)\leq e^2n^n\) if \(n+1\) is not a prime and \(c(n)\leq 1.8n^{n+1}\) if \(n+1\) is a prime.
- Dissecting d-cubes into smaller d-cubes
- A lower bound for the simplexity of the n-cube via hyperbolic volumes
- From divisibility to the cube of dimension four and dimension five
- scientific article; zbMATH DE number 26495 (Why is no real title available?)
- scientific article; zbMATH DE number 3557813 (Why is no real title available?)
- scientific article; zbMATH DE number 617172 (Why is no real title available?)
- scientific article; zbMATH DE number 1026076 (Why is no real title available?)
- Decomposition of a cube into nearly equal smaller cubes
- A stability theorem on cube tessellations
- Dissecting Cuboids into Cuboids
- Sphere decompositions of hypercubes
- Decompositions of Unit Hypercubes and the Reversion of a Generalized M\"obius Series
- Blind men and hypercubes
- Dissecting a brick into bars
This page was built for publication: Decomposing cubes into smaller cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1754406)
