Search results

Page title matches

• Permutation group
  ...ation]]s on a set of objects form a [[group theory|group]], is called a '''permutation group''', with composition as the group operation. For example, let <math>A</math ...[field (algebra)|fields]] ''et cetera'' [[up to]] isomorphism, the generic permutation group over <math>n</math> elements is simply denoted <math>S_n</math>.
  2 KB (244 words) - 20:34, 1 July 2009
• Permutation group/Definition
  202 bytes (29 words) - 10:44, 4 September 2009
• Permutation group/Related Articles
  Auto-populated based on [[Special:WhatLinksHere/Permutation group]]. Needs checking by a human.
  461 bytes (59 words) - 19:27, 11 January 2010

Page text matches

• Permutation group
  ...ation]]s on a set of objects form a [[group theory|group]], is called a '''permutation group''', with composition as the group operation. For example, let <math>A</math ...[field (algebra)|fields]] ''et cetera'' [[up to]] isomorphism, the generic permutation group over <math>n</math> elements is simply denoted <math>S_n</math>.
  2 KB (244 words) - 20:34, 1 July 2009
• Group theory/Related Articles
  {{r|Permutation group}}
  1 KB (180 words) - 17:00, 11 January 2010
• Permutation group/Related Articles
  Auto-populated based on [[Special:WhatLinksHere/Permutation group]]. Needs checking by a human.
  461 bytes (59 words) - 19:27, 11 January 2010
• Symmetric group
  ...intransitive permutation group may be broken up into orbits, a transitive permutation group has to be analyzed with greater subtlety: it could be ''primitive'', or its A ''primitive'' permutation group on the points {1,...,n} (note: we implicitly assume that <math> n > 1 </mat
  8 KB (1,392 words) - 20:52, 25 June 2009
• Symmetrizer
  ...product: "apply one permutation after the other", is a group, known as the permutation group or [[symmetric group]], denoted by ''S''_''N''. After this pream ...ty forms a one-dimensional (and hence irreducible) representation of the permutation group known as the ''symmetric representation''. The symmetrizer is the [[charac
  11 KB (1,655 words) - 09:52, 22 January 2009
• Antisymmetrizer
  ...product: "apply one permutation after the other", is a group, known as the permutation group or [[symmetric group]], denoted by ''S''_''N''. After this pream ...ath> forms a one-dimensional (and hence irreducible) representation of the permutation group known as the ''antisymmetric representation''. The representation being one
  15 KB (2,353 words) - 17:42, 9 December 2008
• Group (mathematics)
  Every group can be expressed in terms of [[permutation group]]s like ''S''₃; this result is [[Cayley's theorem]] and is studi
  19 KB (3,074 words) - 11:11, 13 February 2009
• Russell-Saunders coupling
  ...to an [[irreducible representation]] of the symmetric group (also known as permutation group) S_''N''. In other words, the concept of symmetry under transpos
  22 KB (3,334 words) - 05:36, 6 March 2024
• Chemical bond
  ...ions of all ''N'' molecular electrons and must be adapted to the total [[permutation group]] S_''N'' consisting of ''N''! permutations.<ref>Technically: VB
  37 KB (5,836 words) - 05:36, 6 March 2024