Related papers: On words that are concise in residually finite gro…

Given a group $G$, we write $g^G$ for the conjugacy class of $G$ containing the element $g$. A theorem of B. H. Neumann states that if $G$ is a group in which all conjugacy classes are finite with bounded size, then the commutator subgroup…

The class $A$ of anabelian groups is defined as the collection of finite groups without abelian composition factors. We prove that the commutator word $[x_1,x_2]$ and the power word $x_1^p$ have bounded width in $A$ when $p$ is an odd…

Suppose that G is a nontrivial torsion-free group and w is a word over the alphabet G\cup\{x_1^{\pm1},...,x_n^{\pm1}\}. It is proved that for n\ge2 the group \~G=<G,x_1,x_2,...,x_n | w=1> always contains a nonabelian free subgroup. For n=1…

Let p be a prime. Every finite group G has a normal series each of whose quotients either is p-soluble or is a direct product of nonabelian simple groups of orders divisible by p. The non-p-soluble length of G is defined as the minimal…

We classify all finite groups G such that the product of any two non-inverse conjugacy classes of G is always a conjugacy class of G. We also classify all finite groups G for which the product of any two G-conjugacy classes which are not…

Let $\mathfrak C$ be a class of finite groups which is closed for subgroups, quotients and direct products. Given a profinite group $G$ and an element $x\in G$, we denote by $P_{\mathfrak{C}}(x,G)$ the probability that $x$ and a randomly…

We say that a class of finite structures for a finite first-order signature is $r$-compressible if each structure $G$ in the class has a first-order description of size at most $O(r(|G|))$. We show that the class of finite simple groups is…

We prove that if $G$ is a free-torsion group and $w(t)$ is a word in the alphabet $G \sqcup \{t^{\pm 1}\}$ with exponent sum one, then the group $<G,t|(w(t))^k = 1>$, where $k \geq 2$, is relatively hyperbolic with respect to $G$.

A new class of groups $\mathcal{C}$, containing all coherent RAAGs and all toral relatively hyperbolic groups, is defined. It is shown that, for a group $G$ in the class $\mathcal{C}$, the $\mathbb{Z}[t]$-exponential group…

Given a class $\mathcal{P}$ of groups we say that a group $G$ is fully residually $\mathcal{P}$ if for any finite subset $F$ of $G$, there exists an epimorphism from $G$ to a group in $\mathcal{P}$ which is injective on $F$. It is known…

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…

Let $ x $ be an element of a finite group $ G $ and denote the order of $ x $ by $ \mathrm{ord}(x) $. We consider a finite group $ G $ such that $ \gcd(\mathrm{ord}(x),\mathrm{ord}(y))\leqslant 2 $ for any two vanishing elements $ x $ and $…

Let $G$ be a finite group of order $p^am$, where $p$ is a prime and $m$ is not divisible by $p$, and let $P$ be a Sylow $p$-subgroup of $G$. If $w$ is an outer commutator word, we prove that $P\cap w(G)$ is generated by the intersection of…

Let $G$ be a finite group, define $I(G)=\{x\in G : x^{2}=1\}$, $C(G)=$ set of the cyclic subgroups of $G$, $i(G)=|I(G)|$ and $c(G)=|C(G)|$. In this article, we will classify finite groups with $i(G)=c(G)-r$ for $r=0,1,$ and $2$. We also…

Any finite word $w$ of length $n$ contains at most $n+1$ distinct palindromic factors. If the bound $n+1$ is reached, the word $w$ is called rich. The number of rich words of length $n$ over an alphabet of cardinality $q$ is denoted…

A ring $R$ is said to be clean if each element of $R$ can be written as the sum of a unit and an idempotent. $R$ is said to be weakly clean if each element of $R$ is either a sum or a difference of a unit and an idempotent, and $R$ is said…

A finitary automaton group is a group generated by an invertible, deterministic finite-state letter-to-letter transducer whose only cycles are self-loops at an identity state. We show that, for this presentation of finite groups, the…

Examples are given of profinite groups that are not strongly complete, and have other `bad' properties, yet have only finitely many open subgroups of each finite index. It is shown that a profinite group with the latter property must be…

In a Coxeter group $W$, an element is fully commutative if any two of its reduced expressions can be linked by a series of commutation of adjacent letters. These elements have particularly nice combinatorial properties, and also index a…

A finite word $w$ with $\vert w\vert=n$ contains at most $n+1$ distinct palindromic factors. If the bound $n+1$ is attained, the word $w$ is called \emph{rich}. Let $\Factor(w)$ be the set of factors of the word $w$. It is known that there…