English

Factorization of classical characters twisted by roots of unity

Combinatorics 2022-08-01 v3 Representation Theory

Abstract

For a fixed integer t2t \geq 2, we consider the irreducible characters of representations of the classical groups of types A, B, C and D, namely GLtn,SO2tn+1,Sp2tn\text{GL}_{tn}, \text{SO}_{2tn+1}, \text{Sp}_{2tn} and O2tn\text{O}_{2tn}, evaluated at elements ωkxi\omega^k x_i for 0kt10 \leq k \leq t-1 and 1in1 \leq i \leq n, where ω\omega is a primitive tt'th root of unity. The case of GLtn\text{GL}_{tn} was considered by D. J. Littlewood (AMS press, 1950) and independently by D. Prasad (Israel J. Math., 2016). In this article, we give a uniform approach for all cases. In this article, we give a uniform approach for all cases. We also look at GLtn+1\text{GL}_{tn+1} where we specialize the elements as before and set the last variable to 11. In each case, we characterize partitions for which the character value is nonzero in terms of what we call zz-asymmetric partitions, where zz is an integer which depends on the group. Moreover, if the character value is nonzero, we prove that it factorizes into characters of smaller classical groups. The proof uses Cauchy-type determinant formulas for these characters and involves a careful study of the beta sets of partitions. We also give product formulas for general zz-asymmetric partitions and zz-asymmetric tt-cores. Lastly, we show that there are infinitely many zz-asymmetric tt-cores for tz+2t \geq z+2.

Keywords

Cite

@article{arxiv.2109.11310,
  title  = {Factorization of classical characters twisted by roots of unity},
  author = {Arvind Ayyer and Nishu Kumari},
  journal= {arXiv preprint arXiv:2109.11310},
  year   = {2022}
}

Comments

40 pages, 1 figure, a few more improvements, added more references, final version

R2 v1 2026-06-24T06:15:16.659Z