Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4583455 | Finite Fields and Their Applications | 2006 | 4 Pages |
Abstract
A variant of Prüfer's classical proof of Cayley's theorem on the enumeration of labelled trees counts the nilpotent self-maps of a pointed finite set. Essentially, the same argument can be used to establish the result of Fine and Herstein [Illinois J. Math. 2 (1958) 499–504] that the number of nilpotent n×n matrices over the finite field Fq is qn(n-1).
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory