Skip to main content

All Questions

Filter by
Sorted by
Tagged with
11 votes
2 answers
3k views

Algorithm for decomposing permutations

Is there an algorithm for solving the following problem: let $g_1,\ldots,g_n$ be permutations in some (large) symmetric group, and $g$ be a permutation that is known to be in the subgroup generated by ...
Charles Siegel's user avatar
19 votes
9 answers
3k views

How can I generate random permutations of [n] with k cycles, where k is much larger than log n?

I've been thinking a lot lately about random permutations. It's well-known that the mean and variance of the number of cycles of a permutation chosen uniformly at random from Sn are both ...
Michael Lugo's user avatar

1
4 5 6 7
8