Timeline for 1-related groups
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 15, 2021 at 16:56 | history | edited | Martin Sleziak | CC BY-SA 4.0 |
replaced the link to the arXiv front end; see https://meta.mathoverflow.net/questions/5124/is-it-time-to-replace-links-to-the-ucdavis-arxiv-frontend
|
| Oct 29, 2020 at 9:29 | comment | added | HJRW | Perhaps it's worth mentioning that this proof does not need to be carried out on a punctured surface -- you can also use cyclic tower maps of graphs. Jim Howie proved that such a tower is finite, and again, there's an upper bound deriving from the fact that the number of self-intersections decreases at each stage. In fairness, I suppose you should get a better bound from thinking of it on a surface, since there will be fewer self-intersections, but it will be more complicated to read off the word. | |
| May 28, 2011 at 7:24 | vote | accept | CommunityBot | moved from User.Id=6976 by developer User.Id=69903 | |
| May 27, 2011 at 21:42 | history | answered | Ian Agol | CC BY-SA 3.0 |