SearcharxivSearch

arXiv · 1308.4934

Some remarks on the symplectic group $Sp(2g, \mathbb{Z})$

Abstract

Let $G=\Sp(2g,\mathbb{Z})$ be the symplectic group over the integers. Given $m\in \mathbb{N}$, it is natural to ask if there exists a non-trivial matrix $A\in G$ such that $A^{m}=I$, where $I$ is the identity matrix in $G$. In this paper, we determine the possible values of $m\in \mathbb{N}$ for which the above problem has a solution. We also show that there is an upper bound on the maximal order of an element in $G$. As an illustration, we apply our results to the group $\Sp(4,\mathbb{Z})$ and determine the possible orders of elements in it. Finally, we use a presentation of $\Sp(4,\mathbb{Z})$ to identify some finite order elements and do explicit computations using the presentation to verify their orders.

Explore related subjects

Keep this discovery

BibTeXRIS

Kumar Balasubramanian, Ganesh Ji Omar. 2013-08-22. Some remarks on the symplectic group $Sp(2g, \mathbb{Z})$. https://arxiv.org/abs/1308.4934

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