Timeline for Embedding a linearly ordered free monoid into a linearly ordered group
Current License: CC BY-SA 3.0
8 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Feb 4, 2020 at 23:18 | history | edited | YCor |
edited tags
|
|
Apr 18, 2014 at 5:36 | answer | added | Ian Agol | timeline score: 2 | |
Apr 17, 2014 at 14:03 | answer | added | Matthé van der Lee | timeline score: 1 | |
Apr 9, 2014 at 17:37 | comment | added | Salvo Tringali | For the record: An alternative proof that any free group (and hence any free monoid) is linearly orderable can be found in K. Iwasawa, On linearly ordered groups, J. Math. Soc. Japan 1 (1948), 1-9. Yet, Iwasawa's approach doesn't help much with the OP (as far as I can tell). | |
Apr 9, 2014 at 17:19 | history | edited | Salvo Tringali | CC BY-SA 3.0 |
Improved the text
|
Apr 9, 2014 at 17:03 | comment | added | Salvo Tringali | As for free groups on finite alphabets, see Section 5 in: D. M. Kim and D. Rolfsen, An Ordering for Groups of Pure Braids and Fibre-type Hyperplane Arrangements, Canad. J. Math. 55 (2002), 822-838 (and the references therein). I don't know if the proof of the general statement: "All free groups are linearly orderable" by the same method (which is as simple or difficult, it is up to you, as the finite case), is explicitly written down somewhere. Does anybody know? | |
Apr 9, 2014 at 16:01 | comment | added | boumol | Any reference for what you call "Magnus trick"? | |
Apr 9, 2014 at 15:00 | history | asked | Salvo Tringali | CC BY-SA 3.0 |