Equivalence of symmetries and permutations in \(\mathbb{R}^{n}\) (Q2363610)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6751965
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Equivalence of symmetries and permutations in \(\mathbb{R}^{n}\) |
scientific article; zbMATH DE number 6751965 |
Statements
Equivalence of symmetries and permutations in \(\mathbb{R}^{n}\) (English)
0 references
25 July 2017
0 references
Given a square in \(\mathbb{R}^2\) it is well-known that there is an equivalence between symmetries of \(\mathbb{R}^2\) and permutations of the vertices of the square that preserve adjacency. In this interesting and illustrative work, the authors explore this situation in higher dimensions. They begin with the following conjecture: ``If \(C\) is a hypercube centered at the origin in \(\mathbb{R}^n\) and \(\rho\) is an edge-preserving permutation of the vertices of \(C\), then there is an isometry of \(\mathbb{R}^n\) that maps \(C\) onto itself and agrees with \(\rho\) on the vertices of \(C\)''. Then, the authors consider various particular cases and provide a very visual proof of the conjecture (and also a more ``formal'' one by induction). The paper is worth reading and gives good material for advanced undergraduates.
0 references
symmetries
0 references
hypercube
0 references
permutations
0 references
0.7076040506362915
0 references
0.7052075266838074
0 references
0.6948878169059753
0 references
0.691057562828064
0 references
0.6875280737876892
0 references