111

Reputation

11 views

Registered User

Name
Member for	9 months
Seen	Oct 31 at 9:01
Website
Location
Age

stats recent reputation favorites

0

Questions

2

Answers

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

Exhibit an explicit bijection between irreducible polynomials over finite fields and Lyndon words.

0

Votes

7

Tags

co.combinatorics× 2
pr.probability
permutations
nt.number-theory
markov-chains
finite-fields
algorithms

1

Badges