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 105215
Questions related to permutations, bijections from a finite (or sometimes infinite) set to itself.
7
votes
0
answers
107
views
Smallest set of couples in [n] stable by permutations
What I tried to do was, for a given set, express the number of permutations covered by all the couples, but then I need to pick the couples so that I will minimize the intersections between the $(n-2)! … $ permutations each time.
Has this problem been encountered before, or would you have any idea on how I could find the optimal set ? …
- 189