Timeline for Algorithmically unsolvable problems in topology
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 2, 2012 at 22:32 | comment | added | Malte | The theorem of S.P. Novikov actually asserts that one cannot distinguish homology spheres from the standard sphere if $n\geq 5$. There is a generalization to this due to Nabutovsky--Weinberger asserting that S.P. Novikov's theorem remains valid in the presence of a lower bound on simplicial volume. | |
| Jun 1, 2012 at 23:58 | comment | added | Joseph O'Rourke | @Vitali: I did not realize that aspect. Thank you for clarifying! | |
| Jun 1, 2012 at 23:58 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
added 249 characters in body
|
| Jun 1, 2012 at 23:55 | comment | added | Vitali Kapovitch | @Joseph, note that Novikov's theorem does not assume simply connectednes and uses that fact very strongly. | |
| Jun 1, 2012 at 23:53 | comment | added | Joseph O'Rourke | Oh, I see now that this is mentioned by the OP. Consider this, then, merely adding detail. | |
| Jun 1, 2012 at 23:46 | history | answered | Joseph O'Rourke | CC BY-SA 3.0 |