Product expansions of q-character polynomials
Name
10801_2022_1208_ReferencePDF.pdf
Size
695.26 KB
Format
Adobe PDF
Checksum (MD5)
ef61e1ab8d56c0686d924a4aab5c15a5
Author(s)
Balachandran, Adithya
Gadish, Nir
Huang, Andrew
Sun, Siwen
Date Issued
March 29, 2023
Publisher
Springer US
Citation
Balachandran, Adithya, Gadish, Nir, Huang, Andrew and Sun, Siwen. 2023. "Product expansions of q-character polynomials."
Version
Author's final manuscript
Abstract
Abstract
The ring of q-character polynomials is a q-analog of the classical ring of character polynomials for the symmetric groups. This ring consists of certain class functions defined simultaneously on the groups
$${{\,\textrm{Gl}\,}}_n({\mathbb {F}}_q)$$
Gl
n
(
F
q
)
for all n, which we also interpret as statistics on matrices. Here, we evaluate these statistics on all matrices and work toward computing the structure constants of the product in this ring. We show that the statistics are periodically polynomial in q and governed by universal polynomials
$$P_{\lambda ,\mu }(q)$$
P
λ
,
μ
(
q
)
which we compute explicitly, indexed by pairs of integer partitions. The product structure is similarly polynomial in q in many cases, governed by polynomials
$$R_{\lambda ,\mu }^{\nu }(q)$$
R
λ
,
μ
ν
(
q
)
indexed by triples of partitions, which we compute in some cases. Our calculations seem to exhibit several unexpected patterns. Mainly, we conjecture that certain indecomposable statistics generate the whole ring and indeed prove this for statistics associated with matrices consisting of up to 2 Jordan blocks. Furthermore, the coefficients we compute exhibit surprising stability phenomena, which in turn reflect stabilizations of joint moments as well as multiplicities in the irreducible decomposition of tensor products of representations of
$${{\,\textrm{Gl}\,}}_n({\mathbb {F}}_q)$$
Gl
n
(
F
q
)
for
$$n\gg 1$$
n
≫
1
. We use this stabilization to compute the correlation of the number of unipotent Jordan blocks of two sizes.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s10801-022-01208-0
