Search results

Jump to navigation Jump to search

Page title matches

  • In [[mathematics]], the '''symmetric group''' is the [[group (mathematics)|group]] of all [[permutation]]s of a set, t ...t this is not strictly necessary. The bijections which are elements of the symmetric group are called ''permutations''.
    8 KB (1,392 words) - 20:52, 25 June 2009
  • 129 bytes (22 words) - 06:39, 15 November 2008
  • 297 bytes (38 words) - 07:36, 15 November 2008
  • 846 bytes (136 words) - 06:40, 15 November 2008

Page text matches

  • #REDIRECT [[Symmetric group#Permutational Parity]]
    50 bytes (5 words) - 11:58, 13 December 2008
  • #REDIRECT [[Symmetric group#Cycle Decomposition]]
    49 bytes (5 words) - 02:54, 14 December 2008
  • #REDIRECT [[Symmetric group#Permutational Parity]]
    50 bytes (5 words) - 07:34, 15 November 2008
  • {{r|Symmetric group}}
    1 KB (180 words) - 17:00, 11 January 2010
  • {{r|Symmetric group}}
    749 bytes (92 words) - 16:43, 11 January 2010
  • {{r|Symmetric group}}
    594 bytes (76 words) - 19:15, 11 January 2010
  • The set of all [[permutation]]s of 4 elements forms the symmetric group ''S''<sub>4</sub>, which is of order of 4! = 24. The group of the following ...ic subgroup of order two generated by the 2-cycle <math>(12)</math> in the symmetric group of permutations on symbols <math>1,2,3</math>.
    5 KB (785 words) - 09:22, 30 July 2009
  • ...is a [[permutation]] of the set, and is the [[identity element]] of the [[symmetric group]] on ''X''.
    425 bytes (64 words) - 15:38, 7 February 2009
  • {{r|Symmetric group}}
    1 KB (187 words) - 20:18, 11 January 2010
  • ...math>, then the map <math>A : G \rightarrow S_X</math> from ''G'' to the [[symmetric group]] on ''X'' is a [[group homomorphism]], and every group action arises in th * The symmetric group <math>S_X</math> acts of ''X'' by permuting elements in the natural way.
    4 KB (727 words) - 12:37, 16 November 2008
  • {{r|Symmetric group}}
    633 bytes (79 words) - 19:23, 11 January 2010
  • ...roups which are not normal. For instance, the subgroup of order two in the symmetric group on three elements, is a non-normal subgroup.
    2 KB (358 words) - 02:37, 18 November 2008
  • In [[mathematics]], the '''symmetric group''' is the [[group (mathematics)|group]] of all [[permutation]]s of a set, t ...t this is not strictly necessary. The bijections which are elements of the symmetric group are called ''permutations''.
    8 KB (1,392 words) - 20:52, 25 June 2009
  • ...mutation after the other", is a group, known as the permutation group or [[symmetric group]], denoted by ''S''<sub>''N''</sub>. After this preamble we are ready to g
    11 KB (1,655 words) - 09:52, 22 January 2009
  • ...oups of prime order, cannot be solvable, and so <math>A_5</math> and the [[symmetric group]] <math>S_5</math> are not solvable. This is one of the first important res As a finite example, the [[symmetric group]]s of degree greater than 2 are all nonabelian.
    15 KB (2,535 words) - 20:29, 14 February 2010
  • ...of '''S'''<sup>2</sup> belongs to an [[irreducible representation]] of the symmetric group (also known as permutation group) S<sub>''N''</sub>. In other words, the co
    22 KB (3,334 words) - 05:36, 6 March 2024
  • ...mutation after the other", is a group, known as the permutation group or [[symmetric group]], denoted by ''S''<sub>''N''</sub>. After this preamble we are ready to g
    15 KB (2,353 words) - 17:42, 9 December 2008
  • This group is called the ''[[symmetric group]] on 3 letters'', or ''S''<sub>3</sub>.
    19 KB (3,074 words) - 11:11, 13 February 2009
  • ...ng on mathematics (on the related topics of [[symmetric functions]], the [[symmetric group]] and the theory of higher-order algebraic equations). He attempted admissi
    20 KB (3,286 words) - 12:52, 24 August 2013
  • ...ng on mathematics (on the related topics of [[symmetric functions]], the [[symmetric group]] and the theory of higher-order algebraic equations). He attempted admissi
    20 KB (3,295 words) - 12:51, 24 August 2013
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)