SearcharxivSearch

arXiv · math/0412385

Linear limits of irreducible characters

Abstract

Nearly twenty years ago Isaacs and the first author of this paper wrote a series of articles \cite{isa2}, \cite{da3}, \cite{da2} about what were called ``stabilizer limits'' of group characters, following the terminology of Berger \cite{be}. The second author, in her thesis \cite{lo}, needed one of the results of those articles in a new situation which was not treated earlier. Eventually she was able, by complicated and delicate arguments, to reduce her proof to a special case where \cite[Theorem 8.4]{da3} could be applied. But this approach was extremely awkward. In the present paper we use arguments similar to those in the earlier articles to prove a Main Theorem from which the exact Theorem A needed in \cite{lo} easily follows.

Explore related subjects

Keep this discovery

BibTeXRIS

Everett Dade, Maria Loukaki. 2004-12-19. Linear limits of irreducible characters. https://arxiv.org/abs/math/0412385

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