Invariable generation of prosoluble groups. (Q273113)

According to a definition of \textit{J. D. Dixon} [Discrete Math. 105, No. 1-3, 25-39 (1992; Zbl 0756.60010)], a group \(G\) is said to invariably generated by \(S\subseteq G\) if for every function \(g\colon S\to G\) one has that the conjugates \(s^{g(s)}\) generate \(G\), for \(s\in S\). When \(G\) is a topological group, (invariable) generation is taken in the topological sense. \textit{J. Wiegold} proved that the free group of rank greater than one is not invariably generated by any of its subsets [Arch. Math. 27, 473-475 (1976; Zbl 0372.20023)]. \textit{W. M. Kantor, A. Lubotzky} and \textit{A. Shalev} proved among others that a finite group is invariably generated by a subset of \(\log_2(|G|)\) elements [J. Algebra 348, No. 1, 302-314 (2011; Zbl 1248.20036)], and that a finitely generated linear group is invariably generated by a finite subset if and only if it is virtually soluble [J. Algebra 421, 296-310 (2015; Zbl 1318.20032)]. In the paper under review the authors show first, answering in the negative a question of Kantor, Lubotzky and Shalev, that the free prosoluble groups of rank greater than one are not invariably generated by any finite subset. They are able to deduce this from another result, that states that if \(G\) is a finite, \(2\)-generated soluble group, and \(p\) is the smallest prime dividing the order of \(G\), then either every subset which invariably generates \(G\) has at least \(p\) elements, or there exists a prime \(q\) larger than \(p\), such the minimal size of a subset that invariably generates \(G\) is less than the size of such a set for the wreath product of a cyclic group of order \(q\) by \(G\), taken with respect to the regular representation of \(G\). Then they provide two positive results. The free soluble profinite group of rank \(d\) and derived length \(l\) can be invariably generated by a subset with \(l(d-1)+1\) elements, and no less. The free prosupersoluble group of rank \(d\) can be invariably generated by a subset with \(2d-1\) elements, and no less.

0 references

A group \(G\) is said to be invariable generated by a set \(\{g_1,\ldots,g_m\}\) if for any choices of \(x_1,\ldots,x_m\in G\) the set \(\{g_1^{x_1},\ldots,g_m^{x_m}\}\) generates \(G\). The concept arose in the study of a computational problem in Galois theory; determining when the Galois group of polynomial over \(\mathbb Z\) is the full symmetric group [see \textit{J. D. Dixon}, Discrete Math. 105, No. 1-3, 25-39 (1992; Zbl 0756.60010)]. Assume that \(G\) is a finite group and \(N\) is a normal subgroup. We denote the size of the smallest set which generates \(G\) invariably by \(d_I(G)\), set \(d_I(G,N):=d_I(G)-d_I(G/N)\) and define \(d_G(N)\) to be the size of the smallest generating set of \(N\) as a \(G\)-module. In the present paper the authors show that if \(G\) is a permutation group of degree \(n>3\) then \(d_I(G)\leq\lfloor n/2\rfloor\). In this generality this is best possible since the symmetric group \(S_n\) contains an (intransitive) elementary abelian subgroup of order \(2^{\lfloor n/2\rfloor}\) which requires \(\lfloor n/2\rfloor\) generators. -- The proof depends heavily on the following results: for all normal subgroups \(N\) we have \(d_I(G,N)\leq d_I(N)\), and \(d_I(G,N)\leq d_G(N)\) if \(N\) is abelian [see \textit{W. M. Kantor, A. Lubotzky, A. Shalev}, J. Algebra 421, 296-310 (2015; Zbl 1318.20032)]; if \(N\) is minimal normal then \(d_I(G,N)\leq 2\), and \(d_I(G,N)\leq 1\) if \(N\) is abelian [see \textit{W. M. Kantor A. Lubotzky, A. Shalev}, J. Algebra 348, No. 1, 302-314 (2011; Zbl 1248.20036)]. The latter result shows that \(d_I(G)\) is bounded by twice the length of a chief series for \(G\) and this together with an unpublished result of N. Menezes is used to prove that if \(G\) is primitive subgroup of \(S_n\) then \(d_I(G)\leq\lfloor 4\log n\rfloor\).

0 references

0 references

0 references

invariably generated groups

0 references

numbers of generators

0 references

profinite groups