Related papers: On groups with BFC-covered word values

Let $w = w(x_1,..., x_n)$ be a word, i.e. an element of the free group $F =<x_1,...,x_n>$ on $n$ generators $x_1,..., x_n$. The verbal subgroup $w(G)$ of a group $G$ is the subgroup generated by the set $\{w (g_1,...,g_n)^{\pm 1} | g_i \in…

The category of all idempotent generated semigroups with a prescribed structure $\mathcal{E}$ of their idempotents $E$ (called the biordered set) has an initial object called the free idempotent generated semigroup over $\mathcal{E}$,…

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 $\mathrm{WP}_G$ denote the word problem in a finitely generated group $G$. We consider the complexity of $\mathrm{WP}_G$ with respect to standard deterministic Turing machines. Let $\mathrm{DTIME}_k(t(n))$ be the complexity class of…

We prove that the power word problem for certain metabelian subgroups of $\mathsf{GL}(2,\mathbb{C})$ (including the solvable Baumslag-Solitar groups $\mathsf{BS}(1,q) = \langle a,t \mid t a t^{-1} = a^q \rangle$) belongs to the circuit…

Let $ n, q $ be positive integers. We show that if $ G $ is a finitely generated residually finite group satisfying the identity $ [x,_ny^q]\equiv 1, $ then there exists a function $ f(n) $ such that $ G $ has a nilpotent subgroup of finite…

Let $a=(a_1,\ldots,a_n)$ and $b=(b_1,\ldots,b_n)$ be two $n$-tuples of positive integers, let $X$ be a set of positive integers, and let $g$ be a positive integer. In this work we show an algorithmic process in order to compute all the sets…

The group $\mathfrak{X}(G)$ is obtained from $G\ast G$ by forcing each element $g$ in the first free factor to commute with the copy of $g$ in the second free factor. We make significant additions to the list of properties that the functor…

We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…

Let $G=< x,t\mid w>$ be a one-relator group, where $w$ is a word in $x,t$. If $w$ is a product of conjugates of $x$ then, associated with $w$, there is a polynomial $A_w(X)$ over the integers, which in the case when $G$ is a knot group, is…

Let $F$ be a free group of rank $r$ and fix some $w\in F$. For any compact group $G$ we can define a measure $\mu_{w,G}$ on $G$ by (Haar-)uniformly sampling $g_1,...,g_r\in G$ and evaluating $w(g_1,...,g_r)$. In [arXiv:1802.04862], Magee…

Let $G$ be a finite group with the property that if $a,b$ are commutators of coprime orders, then $|ab|=|a||b|$. We show that $G'$ is nilpotent.

Let $G$ be a finite group of order $n$, and $Z_G=\mathbb{Z}\langle\zeta_{i,g}\mid g\in G,\ i=1,2,\dots,n\rangle$ be the free generic algebra, with canonical action of $G$ according to $(\zeta_{i,g})^x=\zeta_{i,x^{-1}g}$. It is proved that…

For a subgroup $S$ of a group $G$, let $I_G(S)$ denote the set of commutators $[g,s]=g^{-1}g^s$, where $g\in G$ and $s\in S$, so that $[G,S]$ is the subgroup generated by $I_G(S)$. We prove that if $G$ is a $p$-soluble finite group with a…

A graph G is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function w is defined on its vertices. Then G is w-well-covered if all maximal independent sets are of the same weight. For…

For subsets $X,Y$ of a finite group $G$, let $Pr(X,Y)$ denote the probability that two random elements $x\in X$ and $y\in Y$ commute. Obviously, a finite group $G$ is nilpotent if and only if $Pr(P,Q)=1$ whenever $P$ and $Q$ are Sylow…

A finite word $w$ of length $n$ contains at most $n+1$ distinct palindromic factors. If the bound $n+1$ is attained, the word $w$ is called rich. An infinite word $w$ is called rich if every finite factor of $w$ is rich. Let $w$ be a word…

Let ${\cal N}_c$ be the variety of nilpotent groups of class at most $c\ \ (c\geq 2)$ and $G=Z_r\oplus Z_s $ be the direct sum of two finite cyclic groups. It is shown that if the greatest common divisor of $r$ and $s$ is not one, then $G$…

Let $A_q$ be a $q$-letter alphabet and $w$ be a right infinite word on this alphabet. A subword of $w$ is a block of consecutive letters of $w$. The subword complexity function of $w$ assigns to each positive integer $n$ the number $f_w(n)$…

The normal covering number $\gamma(G)$ of a finite, non-cyclic group $G$ is the least number of proper subgroups such that each element of $G$ lies in some conjugate of one of these subgroups. We prove that there is a positive constant $c$…