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 1326
Questions related to permutations, bijections from a finite (or sometimes infinite) set to itself.
9
votes
How can I generate random permutations of [n] with k cycles, where k is much larger than log n?
Various algorithms for the unbiased generation of random permutations of certain types
(such as permutations into k cycles) are given in this thesis submitted just yesterday:
http://www.jjj.de/pub/
Hope …
- 161