Conjugacy in Permutation Representations of the Symmetric Group
DOI10.1080/00927870801938560zbMATH Open1146.20006arXivmath/0411554OpenAlexW2011527283MaRDI QIDQ3514810FDOQ3514810
Authors: Yona Cherniavsky, Mishael Sklarz
Publication date: 23 July 2008
Published in: Communications in Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0411554
Recommendations
- Permutation representations on invertible matrices.
- Some combinatorial problems associated with products of conjugacy classes of the symmetric group
- Theorem about the conjugacy representation of \(S_ n\)
- On conjugacy classes of \(S_{n}\) containing all irreducibles
- Permutation characters and fixed-point-free elements in permutation groups.
permutation matricessymmetric groupsconjugacy classesfixed pointscharacterspermutation representations
Combinatorial aspects of representation theory (05E10) Representations of finite symmetric groups (20C30)
Cites Work
Cited In (7)
- On the construction of permutations of a given type kept fixed by conjugation
- Permutation representations on invertible matrices.
- The conjugacy character of \(S_ n\) tends to be regular
- The algebra of conjugacy classes in symmetric groups, and partial permutations
- Title not available (Why is that?)
- The class equation and counting in factorizable monoids
- On simultaneous conjugation of permutations
This page was built for publication: Conjugacy in Permutation Representations of the Symmetric Group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3514810)