Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1402.6788

An L2-quotient algorithm for finitely presented groups on arbitrarily many generators

Sebastian Jambor
View original source ↗Read source document ↗Export metadata ↓

Abstract

We generalize the Plesken-Fabia\'nska $\mathrm{L}_2$-quotient algorithm for finitely presented groups on two or three generators to allow an arbitrary number of generators. The main difficulty lies in a constructive description of the invariant ring of $\mathrm{GL}(2, K)$ on $m$ copies of $\mathrm{SL}(2, K)$ by simultaneous conjugation. By giving this description, we generalize and simplify some of the known results in invariant theory. An implementation of the algorithm is available in the computer algebra system Magma.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Sebastian Jambor. 2014-02-27. An L2-quotient algorithm for finitely presented groups on arbitrarily many generators. https://arxiv.org/abs/1402.6788

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗