Number of independent subcubes of a hypercube

  • Thread starter twoflower
  • Start date
  • #1
twoflower
368
0
Number of "independent" subcubes of a hypercube

Hello, I am trying to solve this problem: I have an n-dimensional hypercube and m of its vertices. Now I want to compute the maximum number of subcubes of the entire hypercube such that:
- each subcube from the set may contain only those m vertices
- no subcube from the set is part of another subcube from the set

Does anybody have any idea?

Thank you very much.

Best regards,
Standa
 

Answers and Replies

  • #2
Eynstone
336
0


I take the 'subcubes' to be hypercubes of lower dimension.
The answer depends on the positions of the m vertices critically. For each (n-1)dimensional face , find the number of vertices on it. If two adjacent faces contain 2 or more vertices, subtract the number of hypercubes on the common 'edge'. Inductively, calculate the number of hypercubes on each (n-r) D face (r=1,2,...).
 

Suggested for: Number of independent subcubes of a hypercube

Replies
3
Views
1K
Replies
3
Views
2K
  • Last Post
Replies
3
Views
398
Replies
27
Views
5K
Replies
36
Views
2K
Replies
1
Views
199
Replies
7
Views
86
  • Last Post
Replies
13
Views
795
  • Last Post
Replies
1
Views
276
Top