English

Heisenberg characters, unitriangular groups, and Fibonacci numbers

Combinatorics 2012-01-17 v3 Representation Theory

Abstract

Let \UTn(\FFq)\UT_n(\FF_q) denote the group of unipotent n×nn\times n upper triangular matrices over a finite field with qq elements. We show that the Heisenberg characters of \UTn+1(\FFq)\UT_{n+1}(\FF_q) are indexed by lattice paths from the origin to the line x+y=nx+y=n using the steps (1,0),(1,1),(0,1),(1,1)(1,0), (1,1), (0,1), (1,1), which are labeled in a certain way by nonzero elements of \FFq\FF_q. In particular, we prove for n1n\geq 1 that the number of Heisenberg characters of \UTn+1(\FFq)\UT_{n+1}(\FF_q) is a polynomial in q1q-1 with nonnegative integer coefficients and degree nn, whose leading coefficient is the nnth Fibonacci number. Similarly, we find that the number of Heisenberg supercharacters of \UTn(\FFq)\UT_n(\FF_q) is a polynomial in q1q-1 whose coefficients are Delannoy numbers and whose values give a qq-analogue for the Pell numbers. By counting the fixed points of the action of a certain group of linear characters, we prove that the numbers of supercharacters, irreducible supercharacters, Heisenberg supercharacters, and Heisenberg characters of the subgroup of \UTn(\FFq)\UT_n(\FF_q) consisting of matrices whose superdiagonal entries sum to zero are likewise all polynomials in q1q-1 with nonnegative integer coefficients.

Keywords

Cite

@article{arxiv.1105.1003,
  title  = {Heisenberg characters, unitriangular groups, and Fibonacci numbers},
  author = {Eric Marberg},
  journal= {arXiv preprint arXiv:1105.1003},
  year   = {2012}
}

Comments

25 pages; v2: material significantly revised and condensed; v3: minor corrections, final version

R2 v1 2026-06-21T18:03:08.504Z