Timeline for One-step problems in geometry
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 31, 2020 at 8:05 | comment | added | Fedor Petrov | I would say the spherical isoperimetry is a way much more hard result than Harper. | |
| Jan 1, 2020 at 12:43 | comment | added | Ryan O'Donnell | This is a special case of the 'edge isopermetric inequality' on the Boolean cube [Harper '64, "Optimal assignments of numbers to vertices"], which is proved by induction on n. It also follows from the 'Poincare inequality' for the Boolean cube, which can be proven by elementary Fourier analysis (or again by induction). | |
| Dec 18, 2009 at 15:28 | comment | added | Greg Kuperberg | The domain of $f$ is the set of vertices of an $n$-cube. Make a correspondence between these vertices and orthant subsets of the sphere in $n-1$ dimensions. | |
| Dec 18, 2009 at 14:32 | comment | added | Anton Petrunin | I did not solve it --- any hints? | |
| Dec 13, 2009 at 18:40 | history | answered | Greg Kuperberg | CC BY-SA 2.5 |