Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with symmetric-groups
Search options not deleted
user 22846
The symmetric group $S_n$ is the group of permutations of the set of integers $\{1,\dots,n\}$. This has $n!$ elements and is generated by the $n-1$ involutions exchanging consecutive integers. The symmetric groups form the simplest family of Coxeter groups.
5
votes
Accepted
Sum of skew characters over hooks and "odd" partitions
I know you were asking for a reference, and there may be better approaches, but just to offer one proof of your statement based on the Murnaghan–Nakayama formula. Assume $m>0$ then any skew tableaux $ …
- 2,902
4
votes
Character values at a cyclic permutation of a symmetric group
Here's a slightly modified version of Geoff's answer that doesn't use modular representation theory but just the representation theory of the symmetric group.
I'll assume the characters of $\mathfrak …
- 2,902