Jordan types of triangular matrices over a finite field

preprint2022arXivOpen access

Abstract

Let λλ be a partition of an integer nn and Fq{\mathbb F}_q be a finite field of order qq. Let Pλ(q)P_λ(q) be the number of strictly upper triangular n×nn\times n matrices of the Jordan type λλ. It is known that the polynomial PλP_λ has a tendency to be divisible by high powers of qq and Q=q−1Q=q-1, and we put Pλ(q)=qd(λ)Qe(λ)Rλ(q)P_λ(q)=q^{d(λ)}Q^{e(λ)}R_λ(q), where Rλ(0)≠0R_λ(0)\neq0 and Rλ(1)≠0R_λ(1)\neq0. In this article, we study the polynomials Pλ(q)P_λ(q) and Rλ(q)R_λ(q). Our main results: an explicit formula for d(λ)d(λ) (an explicit formula for e(λ)e(λ) is known, see Proposition 3.3 below), a recursive formula for Rλ(q)R_λ(q) (a similar formula for Pλ(q)P_λ(q) is known, see Proposition 3.1 below), the stabilization of RλR_λ with respect to extending λλ by adding strings of 1's, and an explicit formula for the limit series Rλ1∞R_{\lambda1^\infty}. Our studies are motivated by projected applications to the orbit method in the representation theory of nilpotent algebraic groups over finite fields.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.