151

Reputation

66 views

Registered User

Name
Member for	3 years
Seen	Mar 30 at 18:04
Website
Location
Age

stats recent reputation favorites

0

Questions

3

Answers

votes newest views recent

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.

Orthogonal matrices with small entries

0

Votes

8

Tags

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

1

Badges