Searcharxiv⌕ Search

arXiv subjects

Eloisa Detomi

Publications and source records attributed to Eloisa Detomi.

34 records · Page 2Linked to original sources

Strong conciseness in profinite groups

A group word $w$ is said to be strongly concise in a class $\mathcal{C}$ of profinite groups if, for every group $G$ in $\mathcal{C}$ such that $w$ takes less than $2^{\aleph_0}$ values in $G$, the verbal subgroup $w(G)$ is finite. Detomi, Morigi and Shumyatsky established that multilinear commutator words -- and the particular words $x^2$ and $[x^2,y]$ -- have the property that the corresponding verbal subgroup is finite in a profinite group $G$ whenever the word takes at most countably many values in $G$. They conjectured that, in fact, this should be true for every word. In particular, their conjecture included as open cases power words and Engel words. In the present paper, we take a new approach via parametrised words that leads to stronger results. First we prove that multilinear commutator words are strongly concise in the class of all profinite groups. Then we establish that every group word is strongly concise in the class of nilpotent profinite groups. From this we deduce, for instance, that, if $w$ is one of the group words $x^2$, $x^3$, $x^6$, $[x^3,y]$ or $[x,y,y]$, then $w$ is strongly concise in the class of all profinite groups. Indeed, the same conclusion can be reached for all words of the infinite families $[x^m,z_1,\ldots,z_r]$ and $[x,y,y,z_1,\ldots,z_r]$, where $m \in \{2,3\}$ and $r \ge 1$.

math.GR↗

On finite-by-nilpotent groups

Let $γ_n=[x_1,\dots,x_n]$ be the $n$th lower central word. Denote by $X_n$ the set of $γ_n$-values in a group $G$ and suppose that there is a number $m$ such that $|g^{X_n}|\leq m$ for each $g\in G$. We prove that $γ_{n+1}(G)$ has finite $(m,n)$-bounded order. This generalizes the much celebrated theorem of B. H. Neumann that says that the commutator subgroup of a BFC-group is finite.

math.GR↗

Words of Engel type are concise in residually finite groups. Part II

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 concise in residually finite groups. Let w=w(x_1,..,x_k) be a multilinear commutator word, n a positive integer and q a prime power. In the present article we show that the word [w^q,_n y] is concise in residually finite groups while the word [w,_n y] is boundedly concise in residually finite groups.

math.GR↗

BFC-theorems for higher commutator subgroups

A BFC-group is a group in which all conjugacy classes are finite with bounded size. In 1954 B. H. Neumann discovered that if G is a BFC-group then the derived group G' is finite. Let w=w(x_1,\dots,x_n) be a multilinear commutator. We study groups in which the conjugacy classes containing w-values are finite of bounded order. Let G be a group and let w(G) be the verbal subgroup of G generated by all w-values. We prove that if x^G has size at most m for every w-value x, then the derived subgroup of w(G) is finite of order bounded by a function of m and n. If x^{w(G)} has size at most m for every w-value x, then [w(w(G)),w(G)] is finite of order bounded by a function of m and n.

math.GR↗

Words of Engel type are concise in residually finite groups

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 said to be concise if w(G) is finite whenever the set of w-values in G is finite. In the sixties P. Hall asked whether every word is concise but later Ivanov answered this question in the negative. On the other hand, Hall's question remains wide open in the class of residually finite groups. In the present article we show that various generalizations of the Engel word are concise in residually finite groups.

math.GR↗

On profinite groups with commutators covered by countably many cosets

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) depends on the properties of the subgroups. We prove the following theorem. Let C be a class of groups closed under taking subgroups, quotients, and such that in any group the product of finitely many normal C-subgroups is again a C-subgroup. If w is a multilinear commutator and G is a profinite group such that the set of all w-values is contained in a union of countably many cosets g_iG_i where each G_i is in C, then the verbal subgroup w(G) is virtually-C. This strengthens several known results.

math.GR↗

On conciseness of words in profinite groups

Let w be a group word. It is conjectured that if w has only countably many values in a profinite group G, then the verbal subgroup w(G) is finite. In the present paper we confirm the conjecture in the cases where w is a multilinear commutator word, or the word x^2, or the word [x^2,y].

math.GR↗

Maximal subgroups of finite soluble groups in general position

For a finite group $G$ we investigate the difference between the maximum size MaxDim$(G)$ of an "independent" family of maximal subgroups of $G$ and maximum size $m(G)$ of an irredundant sequence of generators of $G$. We prove that MaxDim$(G)=m(G)$ if the derived subgroup of $G$ is nilpotent. However MaxDim$(G)-m(G)$ can be arbitrarily large: for any odd prime $p,$ we construct a finite soluble group with Fitting length 2 satisfying $m(G)=3$ and MaxDim$(G)=p.$

math.GR↗

On the length of a finite group and of its 2-generator subgroups

The nonsoluble length $λ(G)$ of a finite group $G$ is defined as the minimum number of nonsoluble factors in a normal series of $G$ each of whose quotients either is soluble or is a direct product of nonabelian simple groups. The generalized Fitting height of a finite group $G$ is the least number $h=h^*(G)$ such that $F^*_h(G)=G$, where $F^*_1(G)=F^*(G)$ is the generalized Fitting subgroup, and $F^*_{i+1}(G)$ is the inverse image of $F^*(G/F^*_{i}(G))$. In the present paper we prove that if $λ(J)\leq k$ for every 2-generator subgroup $J$ of $G$, then $λ(G)\leq k$. It is conjectured that if $h^*(J)\leq k$ for every 2-generator subgroup $J$, then $h^*(G)\leq k$. We prove that if $h^*(\langle x,x^g\rangle)\leq k$ for all $x,g\in G$ such that $\langle x,x^g\rangle$ is soluble, then $h^*(G)$ is $k$-bounded.

math.GR↗

Coprime invariable generation and minimal-exponent groups

A finite group $G$ is \emph{coprimely-invariably generated} if there exists a set of generators $\{g_1, ..., g_u\}$ of $G$ with the property that the orders $|g_1|, ..., |g_u|$ are pairwise coprime and that for all $x_1, ..., x_u \in G$ the set $\{g_1^{x_1}, ..., g_u^{x_u}\}$ generates $G$. We show that if $G$ is coprimely-invariably generated, then $G$ can be generated with three elements, or two if $G$ is soluble, and that $G$ has zero presentation rank. As a corollary, we show that if $G$ is any finite group such that no proper subgroup has the same exponent as $G$, then $G$ has zero presentation rank. Furthermore, we show that every finite simple group is coprimely-invariably generated. Along the way, we show that for each finite simple group $S$, and for each partition $π_1, ..., π_u$ of the primes dividing $|S|$, the product of the number $k_{π_i}(S)$ of conjugacy classes of $π_i$-elements satisfies $\prod_{i=1}^u k_{π_i}(S) \leq \frac{|S|}{2| Out S|}.$

math.GR↗

Invariable generation of prosoluble groups

A group $G$ is invariably generated by a subset $S$ of $G$ if $G= s^{g(s)} \mid s\in S$ for each choice of $g(s) \in G$, $s \in S$. Answering two questions posed by Kantor, Lubotzky and Shalev, we prove that the free prosoluble group of rank $d \ge 2$ cannot be invariably generated by a finite set of elements, while the free solvable profinite group of rank $d$ and derived length $l$ is invariably generated by precisely $l(d-1)+1$ elements.

math.GR↗

Invariable generation with elements of coprime prime-power order

A finite group $G$ is coprimely-invariably generated if there exists a set of generators $\{g_1, \ldots, g_d\}$ of $G$ with the property that the orders $|g_1|, \ldots, |g_d|$ are pairwise coprime and that for all $x_1, \ldots, x_d \in G$ the set $\{g_1^{x_1}, \ldots, g_d^{x_d}\}$ generates $G$. In the particular case when $|g_1|, \ldots, |g_d|$ can be chosen to be prime-powers we say that $G$ is prime-power coprimely-invariably generated. We will discuss these properties, proving also that the second one is stronger than the first, but that in the particular case of finite soluble groups they are equivalent.

math.GR↗

On countable coverings of word values in profinite groups

We prove the following results. Let w be a multilinear commutator word. If G is a profinite group in which all w-values are contained in a union of countably many periodic subgroups, then the verbal subgroup w(G) is locally finite. If G is a profinite group in which all w-values are contained in a union of countably many subgroups of finite rank, then the verbal subgroup w(G) has finite rank as well. As a by-product of the techniques developed in the paper we also prove that if G is a virtually soluble profinite group in which all w-values have finite order, then w(G) is locally finite and has finite exponent.

math.GR↗

Bounding the Exponent of a Verbal Subgroup

We deal with the following conjecture. If w is a group word and G is a finite group in which any nilpotent subgroup generated by w-values has exponent dividing e, then the exponent of the verbal subgroup w(G) is bounded in terms of e and w only. We show that this is true in the case where w is either the nth Engel word or the word [x^n,y_1,y_2,...,y_k] (Theorem A). Further, we show that for any positive integer e there exists a number k=k(e) such that if w is a word and G is a finite group in which any nilpotent subgroup generated by products of k values of the word w has exponent dividing e, then the exponent of the verbal subgroup w(G) is bounded in terms of e and w only (Theorem B).

math.GR↗

Characterization of finitely generated infinitely iterated wreath products

Given a sequence of $(G_i)_{i \in \N}$ of finite transitive groups of degree $n_i$, let $W_\infty$ be the inverse limit of the iterated permutational wreath products of the first m groups. We prove that $W_\infty$ is (topologically) finitely generated if and only if $\prod_{i=1}^{\infty} (G_i/G_i')$ is finitely generated and the growth of the minimal number of generators of $G_i$ is bounded by $ d...n_1...n_{i-1}$ for a constant $d$. Moreover we give a criterion to decide whether $W_\infty$ is positively finitely generated.

math.GR↗