Conjugacy in permutation representations of the symmetric group

Yona Cherniavsky, Mishael Sklarz

Research output: Contribution to conferencePaperpeer-review

Abstract

Although the conjugacy classes of the general linear group are known, it is not obvious (from the canonic form of matrices) that two permutation matrices are similar if and only if they are conjugate as permutations in the symmetric group, i.e. that conjugacy classes of Sn do not unite under the natural representation. We prove this fact, and give its application to the enumeration of fixed points under a natural action of Sn × Sn. We also consider the permutation representations of Sn which arise from the action of S n on k-tuples, and classify which of them unite conjugacy classes and which do not.

Original languageEnglish
Pages398-402
Number of pages5
StatePublished - 2006
Externally publishedYes
Event18th Annual International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC 2006 - San Diego, CA, United States
Duration: 19 Jun 200623 Jun 2006

Conference

Conference18th Annual International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC 2006
Country/TerritoryUnited States
CitySan Diego, CA
Period19/06/0623/06/06

Keywords

  • Characters
  • Conjugacy classes
  • Fixed points
  • Permutation representations
  • Symmetric group

Fingerprint

Dive into the research topics of 'Conjugacy in permutation representations of the symmetric group'. Together they form a unique fingerprint.

Cite this