Timeline for infinite permutations
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 9, 2010 at 21:50 | comment | added | Joel David Hamkins | A more interesting permutation than sigma would be the permuation tau such that tau(n) = n+2 if n is odd, and tau(n) = n-2 if n is even, except when n=2, where we have t(2) = 1. Thus, tau slides the odd numbers up, the even numbers down, and slips 2 into place at 1 to fill the hole. | |
| Mar 9, 2010 at 21:08 | history | edited | Michael Lugo | CC BY-SA 2.5 |
added 384 characters in body
|
| Mar 9, 2010 at 21:01 | comment | added | kakaz | No! I was wrong and accept it too fast! Suppose we define finite permutation that we have a1=(2,1,3,4,5,6...), a2 = (2,1,4,3,5,6...), a3 = (2,1,4,3,6,5,...) so obviously Your permutation is a limit of such sequence... | |
| Mar 9, 2010 at 20:56 | comment | added | aorq | What does "limit" mean? | |
| Mar 9, 2010 at 20:55 | vote | accept | kakaz | ||
| Mar 9, 2010 at 20:59 | |||||
| Mar 9, 2010 at 20:54 | history | answered | Michael Lugo | CC BY-SA 2.5 |