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 gr.group-theory
Search options not deleted
user 5793
Questions about the branch of algebra that deals with groups.
2
votes
Generalization of Schur's lemma (Update)
I'm afraid I do not know the answer to your problem, but here's a counterexample to your conjecture that the result is zero if $r'\ne r''$.
take $r=(2,1)$ (i.e., the Young diagram with two boxes one t …
- 356
5
votes
Accepted
transposing "unrimmed" permutations
The answer is $a_n=8(n-2)!$ for $n\ge 4$.
Subdivide into cases depending on the values at corners and count. (6 cases give 1, 1 case gives 2 times $(n-2)!$)
- 356