SearcharxivSearch

arXiv · 2008.09508

Solving a group equation of length nine

Abstract

The Levin conjecture was proposed by Levin in 1962 which conjectures the solvability of any group equation with coefficients in a torsion free group. The Levin conjecture is recently shown to hold for group equations of length seven by weight test and curvature distribution. These methods are applied on a group equation of length nine to explore the validity of Levin conjecture. It is found that the Levin conjecture has an affirmative answer for this equation modulo some exceptional cases.

Explore related subjects

Keep this discovery

BibTeXRIS

Muhammad Saeed Akram, Maira Amjid. 2020-08-19. Solving a group equation of length nine. https://arxiv.org/abs/2008.09508

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