Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 186 tok/s
Gemini 2.5 Pro 55 tok/s Pro
GPT-5 Medium 36 tok/s Pro
GPT-5 High 41 tok/s Pro
GPT-4o 124 tok/s Pro
Kimi K2 184 tok/s Pro
GPT OSS 120B 440 tok/s Pro
Claude Sonnet 4.5 35 tok/s Pro
2000 character limit reached

Character factorizations for representations of GL(n,C) (2210.03544v2)

Published 7 Oct 2022 in math.RT and math.GR

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

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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