SearcharxivSearch

arXiv · math/0010303

Radicals and Plotkin's problem concerning geometrically equivalent groups

Abstract

If G and X are groups and N is a normal subgroup of X, then the G-closure of N in X is the normal subgroup X^G= bigcap{kerphi|phi:X-> G, with N subseteq kerphi} of X . In particular, 1^G = R_G X is the G-radical of X. Plotkin calls two groups G and H geometrically equivalent, written G H, if for any free group F of finite rank and any normal subgroup N of F the G-closure and the H-closure of N in F are the same. Quasiidentities are formulas of the form (bigwedge_{i<=n}w_i=1 -> w =1) for any words w, w_i (i<=n) in a free group. Generally geometrically equivalent groups satisfy the same quasiidentiies. Plotkin showed that nilpotent groups G and H satisfy the same quasiidenties if and only if G and H are geometrically equivalent. Hence he conjectured that this might hold for any pair of groups. We provide a counterexample.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rüdiger Göbel, Saharon Shelah. 2000-10-30. Radicals and Plotkin's problem concerning geometrically equivalent groups. https://arxiv.org/abs/math/0010303

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