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 permutations
Search options not deleted
user 498364
Questions related to permutations, bijections from a finite (or sometimes infinite) set to itself.
2
votes
0
answers
125
views
Young diagrams for the block matrices
Let S_n be the group of permutations of n elements. Consider map S_n -> S_mn of block permutations, and an irreducible representation of S_mn (over complex numbers), corresponding to Young diagram Y. … Block permutations: Consider S_n as matrices in GL(n), embed GL(n) into GL(mn) as block matrices with scalar blocks of size m * m, then you got the embedding S_n -> S_mn …
- 17