Papers
Topics
Authors
Recent
Search
2000 character limit reached

Character factorizations for representations of GL(n,C)

Published 7 Oct 2022 in math.RT and math.GR | (2210.03544v2)

Abstract: The aim of this paper is to give another proof of a theorem of D.Prasad, which calculates the character of an irreducible representation of $\text{GL}(mn,\mathbb{C})$ at the diagonal elements of the form $\underline{t} \cdot c_n$, where $\underline{t}=(t_1,t_2,\cdots,t_m)$ $\in$ $(\mathbb{C}*){m}$ and $c_n=(1,\omega_n,\omega_n{2},\cdots,\omega_n{n-1})$, where $\omega_n=e{\frac{2\pi \imath}{n}}$, and expresses it as a product of certain characters for $\text{GL}(m,\mathbb{C})$ at $\underline{t}n$.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.