Heisenberg characters, unitriangular groups, and Fibonacci numbers
Eric Marberg

TL;DR
This paper explores the combinatorial structure of Heisenberg characters and supercharacters of upper triangular unipotent groups over finite fields, revealing connections to Fibonacci, Pell, and Delannoy numbers through polynomial enumeration.
Contribution
It introduces a new combinatorial indexing of Heisenberg characters using lattice paths and establishes polynomial formulas involving well-known number sequences.
Findings
Number of Heisenberg characters is a polynomial in q-1 with Fibonacci leading coefficient.
Number of supercharacters involves Delannoy numbers, providing a q-analogue of Pell numbers.
Counts of various characters are polynomials with nonnegative integer coefficients.
Abstract
Let denote the group of unipotent upper triangular matrices over a finite field with elements. We show that the Heisenberg characters of are indexed by lattice paths from the origin to the line using the steps , which are labeled in a certain way by nonzero elements of . In particular, we prove for that the number of Heisenberg characters of is a polynomial in with nonnegative integer coefficients and degree , whose leading coefficient is the th Fibonacci number. Similarly, we find that the number of Heisenberg supercharacters of is a polynomial in whose coefficients are Delannoy numbers and whose values give a -analogue for the Pell numbers. By counting the fixed points of the action of a certain group of linear characters, we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
