SearcharxivSearch

arXiv · math/0303165

Engel-like Identities Characterizing Finite Solvable Groups

Abstract

In the paper we characterize the class of finite solvable groups by two-variable identities in a way similar to the characterization of finite nilpotent groups by Engel identities. More precisely, a sequence of words $u_1,...,u_n,... $ is called correct if $u_k\equiv 1$ in a group $G$ implies $u_m\equiv 1$ in a group $G$ for all $m>k$. We are looking for an explicit correct sequence of words $u_1(x,y),...,u_n(x,y),...$ such that a group $G$ is solvable if and only if for some $n$ the word $u_n$ is an identity in $G$. Let $u_1=x^{-2}y\min x$, and $u_{n+1} = [xu_nx\min,yu_ny\min]$. The main result states that a finite group $G$ is solvable if and only if for some $n$ the identity $u_n(x,y)\equiv 1$ holds in $G$. In the language of profinite groups this result implies that the provariety of prosolvable groups is determined by a single explicit proidentity in two variables. The proof of the main theorem relies on reduction to J.Thompson's list of minimal non-solvable simple groups, on extensive use of arithmetic geometry (Lang - Weil bounds, Deligne's machinery, estimates of Betti numbers, etc.) and on computer algebra and geometry (SINGULAR, MAGMA) .

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tatiana Bandman, Gert-Martin Greuel, Fritz Grunewald, Boris Kunyavskii, Gerhard Pfister, Eugene Plotkin. 2003-03-13. Engel-like Identities Characterizing Finite Solvable Groups. https://arxiv.org/abs/math/0303165

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