On Counting Twists of a Character Appearing in its Associated Weil Representation
K Vishnu Namboothiri

TL;DR
This paper investigates the number of characters with specific epsilon factor properties that appear in the Weil representation associated with a character of a quadratic extension, providing explicit counts at each conductor level.
Contribution
It offers a precise calculation of how many characters with given epsilon factors occur in the Weil representation for each conductor, advancing understanding of character distributions.
Findings
Explicit counts of characters at each conductor level.
Characterization of epsilon factor conditions for representation components.
Enhanced understanding of Weil representation decompositions.
Abstract
Consider an irreducible, admissible representation of GL(2,) whose restriction to GL(2, breaks up as a sum of two irreducible representations . If , the Weil representation of GL(2,) attached to a character of which does not factor through the norm map from to , then with occurs in if and only if and in if and only if both the epsilon factors are -1. But given a conductor , can we say precisely how many such will appear in ? We calculate the number of such characters at each given conductor in this work.
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.
