The Cycle Length Lemma for random permutations is derived from an equivalence of groupoids, giving a categorified proof of a known result.
Random matrix theory over finite fields: a survey
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
First we survey generating function methods for obtaining useful probability estimates about random matrices in the finite classical groups. Then we describe a probabilistic picture of conjugacy classes which is coherent and beautiful. Connections are made with symmetric function theory, Markov chains, potential theory, Rogers-Ramanujan type identities, quivers, and various measures on partitions.
fields
math.CT 1years
2024 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Groupoid Cardinality and Random Permutations
The Cycle Length Lemma for random permutations is derived from an equivalence of groupoids, giving a categorified proof of a known result.