The Cycle Length Lemma for random permutations is derived from an equivalence of groupoids, giving a categorified proof of a known result.
The probability that an operator is nilpotent
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Choose a random linear operator on a vector space of finite cardinality N: then the probability that it is nilpotent is 1/N. This is a linear analogue of the fact that for a random self-map of a set of cardinality N, the probability that some iterate is constant is 1/N. The first result is due to Fine, Herstein and Hall, and the second is essentially Cayley's tree formula. We give a new proof of the result on nilpotents, analogous to Joyal's beautiful proof of Cayley's formula. It uses only general linear algebra and avoids calculation entirely.
citation-role summary
citation-polarity summary
fields
math.CT 1years
2024 1verdicts
ACCEPT 1roles
background 1polarities
unclear 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.