English
Related papers

Related papers: A nilpotency criterion for some verbal subgroups

200 papers

The width $\wid(G,W)$ of the verbal subgroup $v(G,W)$ of a group $G$ defined by a collection of group words $W$ is the smallest number $m$ in $\mathbb N \cup {+\infty}$ such that every element of $v(G,W)$ is can be represented as the…

Group Theory · Mathematics 2012-02-01 Yu. V. Sosnovsky

For a family of group words $w$ we show that if $G$ is a profinite group in which all $w$-values are contained in a union of finitely many subgroups with a prescribed property, then $w(G)$ has the same property as well. In particular, we…

Group Theory · Mathematics 2011-12-30 Cristina Acciarri , Pavel Shumyatsky

Let w be a group-word. Suppose that the set of all w-values in a profinite group G is contained in a union of countably many cosets of subgroups. We are concerned with the question to what extent the structure of the verbal subgroup w(G)…

Group Theory · Mathematics 2017-11-15 Eloisa Detomi , Marta Morigi , Pavel Shumyatsky

Given a group-word w and a group G, the verbal subgroup w(G) is the one generated by all w-values in G. The word w is called concise if w(G) is finite whenever the set of w-values in G is finite. It is an open question whether every word is…

Group Theory · Mathematics 2019-05-21 Eloisa Detomi , Marta Morigi , Pavel Shumyatsky

Let G be a finite group of nilpotency class 2 and w a group word. In this short paper we show that the probability that a random n-tuple of elements from G satisfies w is at least one over the order of G. This answers a special case of a…

Group Theory · Mathematics 2011-01-25 Matthew Levy

Based on the notions of conciseness and semiconciseness, we show that these properties are not equivalent by proving that a word originally presented by Ol'shanskii is semiconcise but not concise. We further establish that every…

Group Theory · Mathematics 2025-09-19 Andoni Zozaya

We show that, for a finitely generated residually finite group $\Gamma$, the word $[x_1, \ldots, x_k]$ is a probabilistic identity of $\Gamma$ if and only if $\Gamma$ is virtually nilpotent of class less than $k$. Related results,…

Group Theory · Mathematics 2018-01-23 Aner Shalev

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…

Group Theory · Mathematics 2021-02-16 João Azevedo , Pavel Shumyatsky

A word $w$ is concise in a class of groups $\mathcal{C}$ if, for every group $G$ in $\mathcal{C}$, the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in $G$. This notion can be naturally extended to…

Group Theory · Mathematics 2025-05-05 Martina Conte , Jan Moritz Petschick

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…

Group Theory · Mathematics 2023-11-20 Eloisa Detomi , Andrea Lucchini , Marta Morigi , Pavel Shumyatsky

A group-word $w$ is called concise if the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in a group $G$. It is known that there are words that are not concise. The problem whether every word is concise in the…

Group Theory · Mathematics 2024-02-26 Pavel Shumyatsky

Thompson's theorem stated that a finite group $G$ is solvable if and only if every $2$-generated subgroup of $G$ is solvable. In this paper, we prove some new criteria for both solvability and nilpotency of a finite group using certain…

Group Theory · Mathematics 2024-02-29 Hung P. Tong-Viet

We prove that outer commutator words are uniformly concise, i.e. if an outer commutator word w takes m different values in a group G, then the order of the verbal subgroup w(G) is bounded by a function depending only on m and not on w or G.…

Group Theory · Mathematics 2014-02-26 Gustavo A. Fernández-Alcober , Marta Morigi

It is well known that if $G$ is a group and $H$ is a normal subgroup of $G$ of finite index $k$, then $x^k \in H$ for every $x \in G$. We examine finite groups $G$ with the property that $x^k \in H$ for every subgroup $H$ of $G$, where $k$…

Group Theory · Mathematics 2024-07-15 Nicholas J. Werner

A group G has restricted centralizers if for each g in G the centralizer C_G(g) either is finite or has finite index in G. A theorem of Shalev states that a profinite group with restricted centralizers is abelian-by-finite. In the present…

Group Theory · Mathematics 2019-01-16 E. Detomi , M. Morigi , P. Shumyatsky

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…

Group Theory · Mathematics 2025-02-12 Iker de las Heras , Andoni Zozaya

Let $g$ be an element of a 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. We prove that if $G$ is a profinite group…

Group Theory · Mathematics 2016-06-02 E. I. Khukhro , P. Shumyatsky

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…

Group Theory · Mathematics 2021-02-24 Pavel Shumyatsky

It is shown that finite groups in which the order of the product of every pair of elements of co-prime order is the product of the orders, is nilpotent.

Group Theory · Mathematics 2014-11-12 Benjamin Baumslag , James Wiegold

A group-word w is called concise if whenever the set of w-values in a group G is finite it always follows that the verbal subgroup w(G) is finite. More generally, a word w is said to be concise in a class of groups X if whenever the set of…

Group Theory · Mathematics 2014-06-30 Robert Guralnick , Pavel Shumyatsky