Pith. sign in

The probability that an operator is nilpotent

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
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

background 1

citation-polarity summary

fields

math.CT 1

years

2024 1

verdicts

ACCEPT 1

roles

background 1

polarities

unclear 1

representative citing papers

Groupoid Cardinality and Random Permutations

math.CT · 2024-12-20 · accept · novelty 6.0

The Cycle Length Lemma for random permutations is derived from an equivalence of groupoids, giving a categorified proof of a known result.

citing papers explorer

Showing 1 of 1 citing paper.

  • Groupoid Cardinality and Random Permutations math.CT · 2024-12-20 · accept · none · ref 9 · internal anchor

    The Cycle Length Lemma for random permutations is derived from an equivalence of groupoids, giving a categorified proof of a known result.