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 6771
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.
14
votes
Accepted
Dual of a Specht module
Yes, this works over $\mathbb Z$, and the pairing can be explicitly realised with polytabloids. See Section 4 of my paper "On the structure of Specht modules", J. London Math. Soc. 67 (2003) 85–102. ( …
- 1,570
1
vote
Accepted
Reference for the action of the Mullineux involution on a partition with an added good node
The equivalence of Kleshchev's algorithm and Mullineux's algorithm was proved by Ford and Kleshchev, but the result they prove is slightly weaker than you want. The result you're asking for is Coroll …
- 1,570