Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Magic hypercube
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Aspects== A hypercube knows '''n! 2<sup>n</sup>''' Aspectial variants, which are obtained by coordinate reflection ([<sub>k</sub>i] --> [<sub>k</sub>(-i)]) and coordinate permutations ([<sub>k</sub>i] --> [<sub>perm[k]</sub>i]) effectively giving the Aspectial variant: <sup>n</sup>H<sub>m</sub><sup>~R perm(0..n-1)</sup>; R = <sub>k=0</sub>Σ<sup>n-1</sup> ((reflect(k)) ? 2<sup>k</sup> : 0) ; perm(0..n-1) a permutation of 0..n-1 Where reflect(k) true iff coordinate k is being reflected, only then 2<sup>k</sup> is added to R. As is easy to see, only n coordinates can be reflected explaining 2<sup>n</sup>, the n! permutation of n coordinates explains the other factor to the total amount of "Aspectial variants"! Aspectial variants are generally seen as being equal. Thus any hypercube can be represented shown in '''"normal position"''' by: [<sub>k</sub>0] = min([<sub>k</sub>θ ; θ ε {-1,0}]) (by reflection) [<sub>k</sub>1 ; #k=1] < [<sub>k+1</sub>1 ; #k=1] ; k = 0..n-2 (by coordinate permutation) (explicitly stated here: [<sub>k</sub>0] the minimum of all corner points. The axial neighbour sequentially based on axial number)
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)