SearcharxivSearch

arXiv · 1607.07586

Distinguishing finite group characters and refined local-global phenomena

Abstract

Serre obtained a sharp bound on how often two irreducible degree $n$ complex characters of a finite group can agree, which tells us how many local factors determine an Artin $L$-function. We consider the more delicate question of finding a sharp bound when these objects are primitive, and answer these questions for $n=2,3$. This provides some insight on refined strong multiplicity one phenomena for automorphic representations of GL$(n)$. For general $n$, we also answer the character question for the families PSL$(2,q)$ and SL$(2,q)$.

Explore related subjects

Keep this discovery

BibTeXRIS

Kimball Martin, Nahid Walji. 2016-07-26. Distinguishing finite group characters and refined local-global phenomena. https://arxiv.org/abs/1607.07586

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR