Search arXivSearch

arXiv · 1609.08308

On Units in Orders in 2-by-2 Matrices over Quaternion Algebras with Rational Center

Abstract

We generalize an algorithm established in earlier work \cite{algebrapaper} to compute finitely many generators for a subgroup of finite index of an arithmetic group acting properly discontinuously on hyperbolic space of dimension $2$ and $3$, to hyperbolic space of higher dimensions using Clifford algebras. We hence get an algorithm which gives a finite set of generators of finite index subgroups of a discrete subgroup of Vahlen's group, i.e. a group of $2$-by-$2$ matrices with entries in the Clifford algebra satisfying certain conditions. The motivation comes from units in integral group rings and this new algorithm allows to handle unit groups of orders in $2$-by-$2$ matrices over rational quaternion algebras. The rings investigated are part of the so-called exceptional components of a rational group algebra.

Explore related subjects

Keep this discovery

BibTeXRIS

Ann Kiefer. 2016-09-27. On Units in Orders in 2-by-2 Matrices over Quaternion Algebras with Rational Center. https://arxiv.org/abs/1609.08308

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