My Math Forum permutation as a product of factors
 User Name Remember Me? Password

 Abstract Algebra Abstract Algebra Math Forum

 October 22nd, 2007, 04:53 PM #1 Newbie   Joined: Oct 2007 Posts: 3 Thanks: 0 permutation as a product of factors Prove that all permutions in Sn can be produced as products using only the factors sigma=(1 2) and tau=(1 2 3 ... n). Note that tau^-1= tau^n-1.
 October 23rd, 2007, 12:22 AM #2 Site Founder     Joined: Nov 2006 From: France Posts: 824 Thanks: 7 The set of all permutations in Sn is generated by the set of all transpositions of S_n. It is therefore enough to prove that any transposition can be generated by the elements (permutations) (1,2) and (1,...,n). Well, for any transposition (i,j), we have (i,j)=(1,...,n)^(j-2+n)(1,2)(1,...,n)^(n-i+1), which solves the problem (provided I didnt do any computational mistake, but the method is correct anyhow).

 Tags factors, permutation, product

 Thread Tools Display Modes Linear Mode

 Similar Threads Thread Thread Starter Forum Replies Last Post gazing600000 Calculus 1 April 7th, 2013 08:36 AM mathbalarka Number Theory 15 June 15th, 2012 07:36 PM Kappie Abstract Algebra 1 March 13th, 2012 09:30 PM Tartarus Algebra 6 November 26th, 2009 11:31 AM otaniyul Linear Algebra 0 October 30th, 2009 06:40 PM

 Contact - Home - Forums - Cryptocurrency Forum - Top