Groupoid Cardinality and Random Permutations
John C. Baez

TL;DR
This paper explores the connection between groupoid theory and the statistical properties of permutations, specifically focusing on the expected number of cycles, by categorifying the Cycle Length Lemma through groupoid equivalences.
Contribution
It introduces a categorification of the Cycle Length Lemma, linking permutation cycle statistics to groupoid equivalences, providing a new theoretical perspective.
Findings
Categorification of the Cycle Length Lemma via groupoid equivalences
Establishes a new theoretical framework connecting groupoids and permutation statistics
Provides insights into the structure of symmetric groups through categorical methods
Abstract
If we treat the symmetric group as a probability measure space where each element has measure , then the number of cycles in a permutation becomes a random variable. The Cycle Length Lemma describes the expected values of products of these random variables. Here we categorify the Cycle Length Lemma by showing that it follows from an equivalence between groupoids.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Advanced Algebra and Logic · Fuzzy and Soft Set Theory
