SearcharxivSearch

arXiv · 1305.5205

Research talk: On the Classification of Generalized Cartan Matrices of Rank 3

Abstract

In this talk we describe very briefly how Gritsenko and Nikulin classified in \cite{3} the generalised Cartan matrices of rank 3, of elliptic type (so they have the generalised lattice Weyl vector), which are twisted to symmetric generalised Cartan matrices. We then introduce a conjecture on this classification and propose an algorithm for attacking it. The author would like to thank prof. V.V. Nikulin for giving him the opportunity to study this subject.

Explore related subjects

Keep this discovery

BibTeXRIS

Kyriakos Papadopoulos. 2013-07-18. Research talk: On the Classification of Generalized Cartan Matrices of Rank 3. https://arxiv.org/abs/1305.5205

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