Search arXivSearch

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

Word Measures on Wreath Products II

Every word $w$ in $F_r$, the free group of rank $r$, induces a probability measure (the $w$-measure) on every finite group $G$, by substitution of random $G$-elements in the letters. This measure is determined by its Fourier coefficients: the $w$-expectations $E_w[χ]$ of the irreducible characters of $G$. For every finite group $G$, every stable character $χ$ of $G\wr S_n$ (trace of a finitely generated $FI_G$-module), and every word $w\in F_r$, we approximate $E_w[χ]$ up to an error term of $O(n^{-π(w)})$, where $π(w)$ is the primitivity rank of $w$. This generalizes previous works by Puder, Hanany, Magee and the author. As an application we show that random Schreier graphs of representation-stable actions of $G\wr S_n$ are close-to-optimal expanders. The paper reveals a surprising relation between stable representation theory of wreath products and not-necessarily connected Stallings core graphs.

math.GR

Robust quasi-isometric embeddings inapproximable by Anosov representations

Let $\mathbb{K}=\mathbb{R}$ or $\mathbb{C}$. For all but finitely many $m\in \mathbb{N}$, we exhibit the first examples of non-locally rigid, Zariski dense, robust quasi-isometric embeddings of hyperbolic groups in $\mathsf{SL}_m(\mathbb{K})$ which are not limits of Anosov representations. As a consequence, we show that higher rank analogues of Sullivan's structural stabilty theorem and of the density theorem for Kleinian groups fail for Anosov representations in $\mathsf{SL}_m(\mathbb{C}), m\geq 30$.

math.GR

$\mathcal{C}$-Hereditarily conjugacy separable groups and wreath products

We provide a necessary and sufficient condition for the restricted wreath product $A\wr B$ to be $\mathcal{C}$-hereditarily conjugacy separable where $\mathcal{C}$ is an extension-closed pseudovariety of finite groups. Moreover, we prove that the Grigorchuk group is 2-hereditarily conjugacy separable. As an application, we demonstrate that the lamplighter groups and $\mathbb{Z} \wr \mathbb{Z}$ are hereditarily conjugacy separable (but not $p$-conjugacy separable for any prime $p$). This provides infinitely many new examples of solvable, non-polycyclic hereditarily conjugacy separable groups. Furthermore, we study wreath products of cyclic subgroup separable groups and the derived length of iterated wreath products of solvable groups with an abelian base group and, as an application, we give an explicit construction of non-polycyclic hereditarily conjugacy separable groups of arbitrary derived length as iterated wreath products of abelian groups.

math.GR