Timeline for Is there a linear embedding of a simplical 3-complex in R^6?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 3, 2011 at 8:18 | history | undeleted | S. Carnahan♦ | ||
| Jun 21, 2011 at 19:12 | history | deleted | nadbor | ||
| Jun 21, 2011 at 18:45 | comment | added | Andreas Blass | @BS: I assume he means to change the sizes of the cells. | |
| Jun 21, 2011 at 16:08 | answer | added | Ryan Budney | timeline score: 3 | |
| Jun 21, 2011 at 16:06 | comment | added | BS. | What do you mean by "change the dimensions of some of the cells" ? | |
| Jun 21, 2011 at 16:05 | comment | added | Noam D. Elkies | ${\bf R}^7$ is presumably a special case of the embedding of any finite $n$-complex in $2n+1$ dimensional space: first embed in a space of really high dimension by sending each vertex to a different basis vector; then project to a random ${\bf R}^{2n+1}$. This works because generically $n$-dimensional subspaces of $2n+1$ dimensional space don't meet. [And you might want to correct the typo in the title: missing the last I in "simplicIal".] | |
| Jun 21, 2011 at 15:16 | history | asked | nadbor | CC BY-SA 3.0 |