Timeline for infinite permutations
Current License: CC BY-SA 2.5
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 10, 2010 at 16:01 | history | edited | Tony Huynh | CC BY-SA 2.5 |
added 115 characters in body; Post Made Community Wiki
|
| Mar 10, 2010 at 14:55 | history | edited | Tony Huynh | CC BY-SA 2.5 |
deleted 60 characters in body
|
| Mar 10, 2010 at 14:34 | history | edited | Tony Huynh | CC BY-SA 2.5 |
added 58 characters in body
|
| Mar 10, 2010 at 10:50 | comment | added | Douglas Zare | I read the permutations as acting on the other side. | |
| Mar 10, 2010 at 6:39 | comment | added | Tony Huynh | I guess 2 is sent to 1, but the pertinent question is what is 1 sent to? | |
| Mar 10, 2010 at 6:31 | history | edited | Tony Huynh | CC BY-SA 2.5 |
added 38 characters in body
|
| Mar 10, 2010 at 0:05 | history | edited | Tony Huynh | CC BY-SA 2.5 |
added 574 characters in body; edited body
|
| Mar 9, 2010 at 23:10 | comment | added | Douglas Zare | You need another condition to make an infinite product of transpositions a well-defined permutation. Consider $(1~2)(2~3)(3~4)(4~5)...$ What is sent to $1$? | |
| Mar 9, 2010 at 22:31 | history | edited | Tony Huynh | CC BY-SA 2.5 |
deleted 49 characters in body
|
| Mar 9, 2010 at 22:19 | history | edited | Tony Huynh | CC BY-SA 2.5 |
deleted 76 characters in body; added 36 characters in body
|
| Mar 9, 2010 at 22:13 | history | edited | Tony Huynh | CC BY-SA 2.5 |
added 209 characters in body
|
| Mar 9, 2010 at 21:38 | history | answered | Tony Huynh | CC BY-SA 2.5 |