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 9672
Questions related to permutations, bijections from a finite (or sometimes infinite) set to itself.
3
votes
On the symmetric group of 2^n elements
These spaces are related to $2$-Sylow subgroups of $S_n$. For example, if $n=2^k$, then $X^n_{k+1}$ is the set of $2$-Sylow subgroups of $S_n$. To see this, note that $S_n$ acts transitively on $X^n_{ …
- 5,654
6
votes
Provoking involutions further
Define a standard bitableau of size $n$ to be a pair $(P_1, P_2)$ of standard tableaux of total size $n$ such that each of the integers $1,\dotsc, n$ occurs exactly once in either tableau.
Then $I_2( …
- 5,654