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 algebraic-combinatorics
Search options not deleted
user 6771
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
8
votes
Accepted
What is the most general "two in one row for A & in one column for B" theorem?
I can't give you your desired "most general" theorem, but I can say a little about this. In (b), the condition "shape(A) is lexicographically larger than shape(B)" is much stronger than it needs to be …
- 1,570
7
votes
bijection between number of partitions of 2n satisfying certain conditions with number of pa...
For $j\geqslant0$ let $c_j$ denote the $2$-core partition $(j,j-1,\dots,1)$.
Your conditions on partitions of $2n$ can be re-phrased as asking for $2$-restricted partitions of $2$-weight $n$ and $2$- …
- 1,570