Dissecting d-Cubes into Smaller d-Cubes

Author: Hudelson M.

Source: Journal of Combinatorial Theory, Series A, Volume 81, Number 2, February 1998 , pp. 190-200(11)

Publisher: Academic Press

Purchase options

The full text electronic article is available for purchase. You will be able to download the full text electronic article after payment.

$51.12 plus tax      Refund Policy

OR

 
More like this?
Content Key:
Free Content - Free
New Content - New
Open Access Content - Open Access
Subscribed Content - Subscribed
Free Trial Content - Free Trial

Abstract:

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 numberkgesc(d) smaller d-cubes. We derive specific bounds for dles5, and furthermore, we investigate, for given k, the asymptotic behavior of c(d) for those d such that gcd(2d-1, kd-1)=1. Specifically, we show that if gcd (2d-1, 3d-1) then c(d)<6d and that if gcd(2d-1, kd-1) then c(d)=O((2k)d). 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). Copyright 1998 Academic Press.

Language: English

Document Type: Research article

Back to top

Content Key:
Free Content - Free
New Content - New
Open Access Content - Open Access
Subscribed Content - Subscribed
Free Trial Content - Free Trial
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages.
Page Help Click here for Page Help
Shopping cart
Tools
Sign in
Need to register?
Sign up here
Text size: A | A | A | A