Related papers: Engel-like Identities Characterizing Finite Solvab…

Let m, n be positive integers, v a multilinear commutator word and w = v^m. We prove that if G is a residually finite group in which all w-values are n-Engel, then the verbal subgroup w(G) is locally nilpotent. We also examine the question…

Let $G$ be a profinite group in which for every element $x\in G$ there exists a natural number $q=q(x)$ such that $x^q$ is Engel. We show that $G$ is locally virtually nilpotent. Further, let $p$ be a prime and $G$ a finitely generated…

For $G$ a finite group, let $d_2(G)$ denote the proportion of triples $(x, y, z) \in G^3$ such that $[x, y, z] = 1$. We determine the structure of finite groups $G$ such that $d_2(G)$ is bounded away from zero: if $d_2(G) \geq \epsilon >…

We prove that two countable locally finite-by-abelian groups G,H endowed with proper left-invariant metrics are coarsely equivalent if and only if their asymptotic dimensions coincide and the groups are either both finitely-generated or…

For a variety of finite groups $\mathbf H$, let $\overline{\mathbf H}$ denote the variety of finite semigroups all of whose subgroups lie in $\mathbf H$. We give a characterization of the subsets of a finite semigroup that are pointlike…

A subset S of a group G invariably generates G if G = <s^(g(s)) | s in S> for each choice of g(s) in G, s in S. In this paper we study invariable generation of infinite groups, with emphasis on linear groups. Our main result shows that a…

A group is $\textit{finitely axiomatizable}$ (FA) in a class $\mathcal{C}$ if it can be determined up to isomorphism within $\mathcal{C}$ by a sentence in the first-order language of group theory. We show that profinite groups of various…

Let G be a profinite group. The following results are proved. The commutator subgroup G' is finite if and only if G is covered by countably many abelian subgroups. The group G is finite-by-nilpotent if and only if G is covered by countably…

We construct a finitely presented (two-sided) totally orderable group with insoluble word problem.

A subset $S$ of a group $G$ is called an Engel set if, for all $x,y\in S$, there is a non-negative integer $n=n(x,y)$ such that $[x,\,_n y]=1$. In this paper we are interested in finding conditions for a group generated by a finite Engel…

We define the notion of computability of F{\o}lner sets for finitely generated amenable groups. We prove, by an explicit description, that the Kharlampovich group, a finitely presented solvable group with unsolvable word problem, has…

Let $w$ be a word in $k$ variables. For a finite nilpotent group $G$, a conjecture of Amit states that $N_w(1) \ge |G|^{k-1}$, where $N_w(1)$ is the number of $k$-tuples $(g_1,...,g_k)\in G^{(k)}$ such that $w(g_1,...,g_k)=1$. Currently,…

Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of nonabelian simple groups. The minimum number of nonsolvable factors attained on all possible such series is called the…

A word $w$ is said to be concise in a class of groups if, for every $G$ in that class such that the set of $w$-values $w\{G\}$ is finite, the verbal subgroup $w(G)$ is also finite. In the context of profinite groups, the notion of strong…

Let $g$ be an element of a finite group $G$. For a positive integer $n$, let $E_n(g)$ be the subgroup generated by all commutators $[...[[x,g],g],\dots,g]$ over $x\in G$, where $g$ is repeated $n$ times. By Baer's theorem, if $E_n(g)=1$,…

We show that for any finite group $G$ and for any $d$ there exists a word $w\in F_{d}$ such that a $d$-tuple in $G$ satisfies $w$ if and only if it generates a solvable subgroup. In particular, if $G$ itself is not solvable, then it cannot…

Given a group word $w$ and a group $G$, the set of $w$-values in $G$ is denoted by $G_w$ and the verbal subgroup $w(G)$ is the one generated by $G_w$. In the present paper we consider profinite groups admitting a word $w$ such that the…

Let $G$ be a finite group and construct a graph $\Delta(G)$ by taking $G\setminus\{1\}$ as the vertex set of $\Delta(G)$ and by drawing an edge between two vertices $x$ and $y$ if $\langle x,y\rangle$ is cyclic. Let $K(G)$ be the set…

Let $G=F\ast_\varphi t$ be an HNN extension of a free group $F$ with two equal associated normal subgroups $H_1 = H_2$ of finite index. We prove that the word problem in $G$ is decidable in polynomial time. This result extends to the case…

Let $G$ be a finite group and $p$ a fixed prime divisor of $|G|$. Combining the nilpotence, the normality and the order of groups together, we prove that if every maximal subgroup of $G$ is nilpotent or normal or has $p'$-order, then (1)…