Representations of symmetric groups with non-trivial determinant

DOI10.1016/J.JCTA.2017.03.004zbMath1362.05012arXiv1604.08837OpenAlexW2345136870MaRDI QIDQ2397106

Amritanshu Prasad, Steven Spallone, Arvind Ayyer

Publication date: 29 May 2017

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Abstract: We give a closed formula for the number of partitions $lambda$ of $n$ such that the corresponding irreducible representation $V_lambda$ of $S_n$ has non-trivial determinant. We determine how many of these partitions are self-conjugate and how many are hooks. This is achieved by characterizing the $2$-core towers of such partitions. We also obtain a formula for the number of partitions of $n$ such that the associated permutation representation of $S_n$ has non-trivial determinant.

Full work available at URL: https://arxiv.org/abs/1604.08837

zbMATH Keywords

determinantssymmetric groupcoreirreducible representationspermutation representationsBell numbersquotientscore-towers

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Combinatorial aspects of representation theory (05E10) Symmetric groups (20B30)

Cites Work

• Odd partitions in Young's lattice
• Applied finite group actions.
• On the Degrees of the Irreducible Representations of Symmetric Groups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

Related Items (4)

Arithmetic identities for class regular partitions ⋮ A \(D\)-finiteness result for products of permutations ⋮ Determinants of representations of Coxeter groups ⋮ Spinorial representations of symmetric groups

Uses Software

• OEIS
• Sage-Combinat
• Unnamed Item

This page was built for publication: Representations of symmetric groups with non-trivial determinant