Timeline for Is there a one-relator circle-packing theorem?

11 events

when toggle format	what		by	license	comment
S Dec 31, 2020 at 23:04	history	bounty ended	CommunityBot
S Dec 31, 2020 at 23:04	history	notice removed	CommunityBot
Dec 24, 2020 at 0:02	history	edited	seldom seen	CC BY-SA 4.0	added 59 characters in body
S Dec 23, 2020 at 21:36	history	bounty started	seldom seen
S Dec 23, 2020 at 21:36	history	notice added	seldom seen		Draw attention
Sep 2, 2019 at 18:14	comment	added	user1729		If you are willing to assume that the word $w$ is a proper power, so there exists some word $v$ and some integer $n>1$ s.t. $w\equiv v^n$, then there are some pretty strong restrictions on the shape of possible diagrams. The starting point is B.B.Newman's Spelling Theorem, which says (roughly) that any disc diagram must contain a cyclic shift of $W^{n-1}$ on the boundary (or its inverse). Hruska and Wise went much further in their paper "Towers, ladders and the B. B. Newman Spelling Theorem", J. Aust. Math. Soc. (2001). "Towers" is the method of proof, "ladder" is the shape of the diagrams.
Sep 2, 2019 at 11:33	history	edited	seldom seen	CC BY-SA 4.0	added 1 character in body
Aug 30, 2019 at 22:14	history	edited	YCor		edited tags
Aug 30, 2019 at 21:54	history	edited	seldom seen	CC BY-SA 4.0	added 20 characters in body
Aug 30, 2019 at 21:41	history	edited	seldom seen	CC BY-SA 4.0	added 124 characters in body
Aug 30, 2019 at 21:32	history	asked	seldom seen	CC BY-SA 4.0