Timeline for Local complexity of triangulations
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 27, 2022 at 17:17 | comment | added | Andi Bauer | Do you think there's any chance to prove this purely combinatorially? By taking a given triangulation and refining it? Maybe one could take the dual cellulation and try to triangulate every $n$-cell with a finite number of $n$-simplices adjacent to each corner vertices (without interior vertices)? | |
| Jun 27, 2022 at 15:35 | comment | added | Andi Bauer | Haha, I just asked the exact same question here on mathoverflow, will have to delete again :D | |
| May 4, 2022 at 18:56 | answer | added | skupers | timeline score: 2 | |
| Dec 27, 2020 at 13:05 | comment | added | Sam Nead | Sorry, sorry. I meant (and should have written) "And let us know the outcome, please!" I mean, don't share anything private, but do let us know whatever history you find out... I am giving up now. Internetting is hard. | |
| Dec 27, 2020 at 2:40 | comment | added | Fedya | I mean that it answers the question, not that it's what Daryl would have intended in 1988. | |
| Dec 26, 2020 at 21:02 | comment | added | Moishe Kohan | @Fedya: You probably mean “the answer”, since it is “an answer” regardless. | |
| Dec 26, 2020 at 18:46 | comment | added | Fedya | @SamNead, I do believe my answer is an answer! Cooper is a colleague of mine and I have asked him whether what he intended is similar. | |
| Dec 26, 2020 at 15:00 | comment | added | Sam Nead | Cooper is alive and I believe responds to emails. Ask him? And let us know the answer, please! | |
| Dec 24, 2020 at 17:35 | answer | added | Fedya | timeline score: 4 | |
| Dec 23, 2020 at 18:47 | answer | added | Ian Agol | timeline score: 7 | |
| Dec 23, 2020 at 18:10 | history | edited | Moishe Kohan | CC BY-SA 4.0 |
added 309 characters in body
|
| Dec 23, 2020 at 15:10 | history | asked | Moishe Kohan | CC BY-SA 4.0 |