Conjugacy in Permutation Representations of the Symmetric Group
Yona Cherniavsky, Mishael Sklarz
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 x Sn. We also consider the permutation representations of Sn which arise from the action of Sn on k-tuples, and classify which of them unite conjugacy classes and which do not.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.