Dimension-independent statistics of Gl_n(F_q) via character polynomials
From MaRDI portal
Publication:5212410
Permutations, words, matrices (05A05) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Ordinary representations and characters (20C15) Linear algebraic groups over finite fields (20G40) Probabilistic methods in group theory (20P05) Combinatorial aspects of groups and algebras (05E16)
Abstract: Picking permutations at random, the expected number of k-cycles is known to be 1/k and is, in particular, independent of the size of the permuted set. This short note gives similar size-independent statistics of finite general linear groups: ones that depend only on small minors. The proof technique uses combinatorics of categories, motivated by representation stability, and applies simultaneously to symmetric groups, finite linear groups and many other settings.
Recommendations
- Some asymptotic results on finite vector spaces
- Cycle indices for the finite classical groups
- Permutation statistics of products of random permutations
- GL(n, q) and increasing subsequences in non-uniform random permutations
- On the distribution of the number of fixed vectors for the finite classical groups
Cites work
- Categories of FI type: a unified approach to generalizing representation stability and character polynomials
- On the distribution of the number of fixed vectors for the finite classical groups
- Random matrix theory over finite fields
- Representation stability in cohomology and asymptotics for families of varieties over finite fields
Cited in
(2)
This page was built for publication: Dimension-independent statistics of \(\operatorname{Gl}_n(\mathbb{F}_q)\) via character polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5212410)