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 517431
Questions related to permutations, bijections from a finite (or sometimes infinite) set to itself.
30
votes
0
answers
808
views
Interpretation of "1089-number trick" in terms of symmetric group action on cohomology group?
In this way we can find other "number tricks" by using other null-relations between permutations: for instance, if $\rho\in\Sigma_3$ is the rotation $\rho(abc) = cab$, then one can use the relation
$$( … To sum up the above discussion, behind the curtain of these "number tricks" is a null-relation of permutations, which implies that the computation depends only on the carrying involved. …
- 301