Understanding the cycle decomposition: Revision history

2 December 2011

• curprev 17:3417:34, 2 December 2011‎ Vipul talk contribs‎ 16,040 bytes −32‎ No edit summary
• curprev 17:1817:18, 2 December 2011‎ Vipul talk contribs‎ 16,072 bytes +9‎ →‎Writing each cycle
• curprev 17:1717:17, 2 December 2011‎ Vipul talk contribs‎ 16,063 bytes +47‎ →‎Some easy examples
• curprev 17:1617:16, 2 December 2011‎ Vipul talk contribs‎ 16,016 bytes +62‎ →‎The cycle decomposition: obtaining the decomposition
• curprev 17:1317:13, 2 December 2011‎ Vipul talk contribs‎ 15,954 bytes −3‎ →‎Finite examples
• curprev 17:1317:13, 2 December 2011‎ Vipul talk contribs‎ 15,957 bytes −19‎ →‎Finite examples
• curprev 17:1017:10, 2 December 2011‎ Vipul talk contribs‎ 15,976 bytes +3‎ →‎Computing the powers of a permutation
• curprev 17:1017:10, 2 December 2011‎ Vipul talk contribs‎ 15,973 bytes +242‎ →‎Computing the powers of a permutation
• curprev 17:0717:07, 2 December 2011‎ Vipul talk contribs‎ 15,731 bytes +139‎ →‎Cycle type of a permutation
• curprev 17:0517:05, 2 December 2011‎ Vipul talk contribs‎ 15,592 bytes +88‎ →‎Cycle type of a permutation
• curprev 17:0517:05, 2 December 2011‎ Vipul talk contribs‎ 15,504 bytes +246‎ →‎Writing the cycle decomposition
• curprev 17:0317:03, 2 December 2011‎ Vipul talk contribs‎ 15,258 bytes −245‎ →‎Some easy examples
• curprev 17:0217:02, 2 December 2011‎ Vipul talk contribs‎ 15,503 bytes +73‎ →‎Integers modulo seven with some polynomial maps
• curprev 17:0217:02, 2 December 2011‎ Vipul talk contribs‎ 15,430 bytes +172‎ →‎Integers modulo seven with some polynomial maps

3 November 2010

• curprev 00:4400:44, 3 November 2010‎ Vipul talk contribs‎ 15,258 bytes +252‎ No edit summary

5 February 2009

• curprev 00:1700:17, 5 February 2009‎ Vipul talk contribs‎ 15,006 bytes +18‎ No edit summary

4 February 2009

• curprev 21:2821:28, 4 February 2009‎ Vipul talk contribs‎ 14,988 bytes +127‎ No edit summary

1 December 2008

• curprev 22:2822:28, 1 December 2008‎ Vipul talk contribs‎ 14,861 bytes +1,779‎ →‎Computation using cycle structure
• curprev 22:1622:16, 1 December 2008‎ Vipul talk contribs‎ 13,082 bytes +1,216‎ No edit summary
• curprev 21:4221:42, 1 December 2008‎ Vipul talk contribs‎ 11,866 bytes +2,455‎ No edit summary
• curprev 20:4120:41, 1 December 2008‎ Vipul talk contribs‎ 9,411 bytes +1‎ No edit summary
• curprev 20:3920:39, 1 December 2008‎ Vipul talk contribs‎ 9,410 bytes +92‎ →‎The directed graph associated with a function

12 November 2008

• curprev 00:3000:30, 12 November 2008‎ Vipul talk contribs‎ 9,318 bytes +2,807‎ →‎The cycle decomposition: how it can loop back

11 November 2008

• curprev 23:1023:10, 11 November 2008‎ Vipul talk contribs‎ 6,511 bytes +1,266‎ No edit summary
• curprev 22:2922:29, 11 November 2008‎ Vipul talk contribs‎ 5,245 bytes +1,532‎ No edit summary
• curprev 22:2122:21, 11 November 2008‎ Vipul talk contribs‎ 3,713 bytes +3,713‎ New page: {{survey article|cycle decomposition for permutations}} A permutation on a set <math>S</math> is a bijective map from <math>S</math> to itself. There are many ways of describing permutati...