SearcharxivSearch

arXiv · 0903.2096

On Systems of Equations over Free Products of Groups

Abstract

Using an analogue of Makanin-Razborov diagrams, we give a description of the solution set of systems of equations over an equationally Noetherian free product of groups $G$. Equivalently, we give a parametrisation of the set $Hom(H, G)$ of all homomorphisms from a finitely generated group $H$ to $G$. Furthermore, we show that every algebraic set over $G$ can be decomposed as a union of finitely many images of algebraic sets of NTQ systems. If the universal Horn theory of $G$ (the theory of quasi-identities) is decidable, then our constructions are effective.

Explore related subjects

Keep this discovery

BibTeXRIS

Montserrat Casals-Ruiz, Ilya Kazachkov. 2009-03-12. On Systems of Equations over Free Products of Groups. https://arxiv.org/abs/0903.2096

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