English

Cohen-Lenstra heuristics and random matrix theory over finite fields

Number Theory 2013-07-04 v1 Combinatorics

Abstract

Let g be a random element of a finite classical group G, and let \lambda_{z-1}(g) denote the partition corresponding to the polynomial z-1 in the rational canonical form of g. As the rank of G tends to infinity, \lambda_{z-1}(g) tends to a partition distributed according to a Cohen-Lenstra type measure on partitions. We give sharp upper and lower bounds on the total variation distance between the random partition \lambda_{z-1}(g) and the Cohen-Lenstra type measure.

Keywords

Cite

@article{arxiv.1307.0879,
  title  = {Cohen-Lenstra heuristics and random matrix theory over finite fields},
  author = {Jason Fulman},
  journal= {arXiv preprint arXiv:1307.0879},
  year   = {2013}
}
R2 v1 2026-06-22T00:44:36.577Z