Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · math/0312509

Implicit function theorem over free groups

O. Kharlampovich·A. Miasnikov
View original source ↗Read source document ↗Export metadata ↓

Abstract

We introduce the notion of a regular quadratic equation and a regular NTQ system over a free group. We prove the results that can be described as Implicit function theorems for algebraic varieties corresponding to regular quadratic and NTQ systems. We will also show that the Implicit function theorem is true only for these varieties. In algebraic geometry such results would be described as lifting solutions of equations into generic points. From the model theoretic view-point we claim the existence of simple Skolem functions for particular $\forall\exists$-formulas over free groups. Proving these theorems we describe in details a new version of the Makanin-Razborov process for solving equations in free groups. We also prove a weak version of the Implicit function theorem for NTQ systems which is one of the key results in the solution of the Tarski's problems about the elementary theory of a free group.

Explore related subjects

math.GRmath.LO

Keep this discovery

BibTeXRIS

O. Kharlampovich, A. Miasnikov. 2005-04-06. Implicit function theorem over free groups. https://arxiv.org/abs/math/0312509

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↗