SearcharxivSearch

arXiv · math/0412315

Paquets d'Arthur discrets pour un groupe classique p-adique

Abstract

In this paper we construct some packets of representations which have to correspond to relatively general Arthurs packets; this is for any classical group $G$ over a p-adic field $F$. An Arthur's packet correspond to a map $ψ$ from $W_{F} \times SL(2,{\mathbb C}) \times SL(2,{\mathbb C})$ into the $L$-group of $G$. The packets we consider here have the property that the centralizer of $ψ$ in the dual group is a finite groupe. Our construction is a combinatorial one which reduce the study of the representations in such a packet to tempered representation of eventualy smaller groups; in fact we give a precise description of the representations associated to $ψ$ and a character of the centralizer of $ψ$ in the L-group in the Grothendieck group. Stability properties follow easily from analogous properties for the tempered packet which enter the situation.

Explore related subjects

Keep this discovery

BibTeXRIS

Colette Moeglin. 2004-12-16. Paquets d'Arthur discrets pour un groupe classique p-adique. https://arxiv.org/abs/math/0412315

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