Search arXivSearch

arXiv · 0904.1421

Some quadratic equations in the free group of rank 2

Abstract

For a given quadratic equation with any number of unknowns in any free group F, with right-hand side an arbitrary element of F, an algorithm for solving the problem of the existence of a solution was given by Culler. The problem has been studied by the authors for parametric families of quadratic equations arising from continuous maps between closed surfaces, with certain conjugation factors as the parameters running through the group F. In particular, for a one-parameter family of quadratic equations in the free group F_2 of rank 2, corresponding to maps of absolute degree 2 between closed surfaces of Euler characteristic 0, the problem of the existence of faithful solutions has been solved in terms of the value of the self-intersection index mu: F_2 --> Z[F_2] on the conjugation parameter. The present paper investigates the existence of faithful, or non-faithful, solutions of similar families of quadratic equations corresponding to maps of absolute degree 0.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Daciberg Goncalves, Elena Kudryavtseva, Heiner Zieschang. 2009-04-08. Some quadratic equations in the free group of rank 2. https://doi.org/10.2140/gtm.2008.14.219

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