The Cycle Length Lemma for random permutations is derived from an equivalence of groupoids, giving a categorified proof of a known result.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.