Dissecting \(d\)-cubes into smaller \(d\)-cubes (Q1380349): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / reviewed by
 
Property / reviewed by: Patric R. J. Östergård / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Patric R. J. Östergård / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/jcta.1997.2837 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2091028676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unsolved problems in geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of a Cube into Smaller Cubes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:17, 28 May 2024

scientific article
Language Label Description Also known as
English
Dissecting \(d\)-cubes into smaller \(d\)-cubes
scientific article

    Statements

    Dissecting \(d\)-cubes into smaller \(d\)-cubes (English)
    0 references
    0 references
    31 March 1998
    0 references
    Let \(c(d)\) be the smallest positive integer such that for all \(k \geq c(d)\), a \(d\)-dimensional cube can be dissected into \(k\) homothetic \(d\)-dimensional cubes of smaller, not necessarily equal size. Since a single (small) cube can be dissected into \(2^d\) cubes with halved side lengths, an upper bound on \(c(d)\) can be obtained by constructing dissections whose numbers of cubes constitute a complete residue system modulo \(2^d-1\). The results in the paper are based on this observation and constructions of small dissections. The author gives exact values and upper bounds on \(c(d)\) for \(d \leq 5\), the only new result being \(c(4) \leq 809\) (apparently, some of the old results have not earlier appeared in print). The author gives the asymptotic result \(c(d) \in O((2d)^{d-1})\), thereby improving a result by \textit{P. Erdős} [Math. Balkanica 4, 197-202 (1974; Zbl 0313.10045)]. This bound is further improved in some special cases.
    0 references
    cube
    0 references
    dissections
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references