- #1
jorgealnino
- 3
- 0
Hi
Taking the intersection of a n-cube with any hyperplane, i would like to know the maximum number X of non adjacent vertices of the cube lying in such intersection.
In R2 for instance, i can cut the unit square {(0,0),(1,0),(1,1),(0,1)} with a diagonal line passing through
(1,0) and (0,1). Hence, X=2
In R3 i have the cube {(0,0,0),(1,0,0),(1,0,1),(0,0,1),(0,1,0),(1,1,0),(1,1,1),(0,1,1)} and the plane x1 + x2 + x3 = 1 touches the points {(1,0,0),(0,0,1),(0,1,0)}. Thus X=3?
In Rn, X = n? and if it is, how to show it?
Thanks for any hint!
Taking the intersection of a n-cube with any hyperplane, i would like to know the maximum number X of non adjacent vertices of the cube lying in such intersection.
In R2 for instance, i can cut the unit square {(0,0),(1,0),(1,1),(0,1)} with a diagonal line passing through
(1,0) and (0,1). Hence, X=2
In R3 i have the cube {(0,0,0),(1,0,0),(1,0,1),(0,0,1),(0,1,0),(1,1,0),(1,1,1),(0,1,1)} and the plane x1 + x2 + x3 = 1 touches the points {(1,0,0),(0,0,1),(0,1,0)}. Thus X=3?
In Rn, X = n? and if it is, how to show it?
Thanks for any hint!