SearcharxivSearch

arXiv · 2111.15277

Markov's problem for free groups

Abstract

We prove that every unconditionally closed subset of a free group is algebraic, thereby answering affirmatively a 76 years old problem of Markov for free groups. In modern terminology, this means that Markov and Zariski topologies coincide in free groups. It follows that the class of groups for which Markov and Zariski topologies coincide is not closed under taking quotients. We also show that Markov and Zariski topologies differ from the so-called precompact Markov topology in non-commutative free groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Dmitri Shakhmatov, Víctor Hugo Yañez. 2021-11-30. Markov's problem for free groups. https://arxiv.org/abs/2111.15277

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