SearcharxivSearch

arXiv · 1203.3617

The stabilizers in a Drinfeld modular group of the vertices of its Bruhat-Tits tree: an elementary approach

Abstract

Let $K$ be an algebraic function field of one variable with constant field $k$ and let $C$ be the Dedekind domain consisting of all those elements of $K$ which are integral outside a fixed place $\infty$ of $K$. When $k$ is finite the group $GL_2(C)$ plays a central role in the theory of Drinfeld modular curves analagous to that played by $SL_2(Z)$ in the classical theory of modular forms. When $k$ is finite (resp. infinite) we refer to a group $GL_2(C)$ as an arithmetic (resp. non-arithmetic) Drinfeld modular group. Associated with $GL_2(C)$ is its Bruhat-Tits tree, $T$. The structure of the group is derived from that of the quotient graph $GL_2(C)\backslash T$. Using an elementary approach which refers explicitly to matrices we determine the structure of all the vertex stabilizers of $T$. This extends results of Serre, Takahashi and the authors. We also determine all possible valencies of the vertices of $GL_2(C)\backslash T$ for the important special case where $\infty$ has degree 1.

Explore related subjects

Keep this discovery

BibTeXRIS

A. W. Mason, Andreas Schweizer. 2013-03-04. The stabilizers in a Drinfeld modular group of the vertices of its Bruhat-Tits tree: an elementary approach. https://doi.org/10.1142/s0218196713500410

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