Timeline for In what rigorous sense are Sperner's Lemma and the Brouwer Fixed Point Theorem equivalent?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 14, 2023 at 17:14 | comment | added | Reinstate Monica | Degenerate reductions that don't use the result of the dependent algorithm are possible just like degenerate corollaries that don't use the proofs of their dependent theorems. You need to do something special like ensure the transformation of the output from the dependent algorithm only takes that output, not the original or transformed problem instance. | |
| Jun 15, 2020 at 7:27 | history | edited | CommunityBot |
Commonmark migration
|
|
| Apr 5, 2020 at 15:47 | comment | added | StefanH | I do not understand the definition of your problem SPERNER. For some fixed $n$ points $(a,b)$ with $a + b = n$ will be contained on some fixed line. In three dimensions, for example points $(a,b,c)$ with $a+b+c=2$ will give triangulations of a bigger triangle, but this is just guesswork on my part. Saying that points on a line are a triangulations sound really odd to me... | |
| Sep 28, 2013 at 13:37 | history | edited | usul | CC BY-SA 3.0 |
added 16 characters in body
|
| Jun 7, 2013 at 1:12 | history | edited | usul | CC BY-SA 3.0 |
added a PS
|
| Jun 7, 2013 at 1:02 | history | edited | usul | CC BY-SA 3.0 |
added 123 characters in body
|
| Jun 7, 2013 at 0:55 | history | answered | usul | CC BY-SA 3.0 |