Related papers: Strongly generating elements in finite and profini…

Given a finite group $G,$ let $e(G)$ be expected number of elements of $G$ which have to be drawn at random, with replacement, before a set of generators is found. If all the Sylow subgroups of $G$ can be generated by $d$ elements, then…

We provide lower estimates on the minimal number of generators of the profinite completion of free products of finite groups. In particular, we show that if C_1,...,C_n are finite cyclic groups then there exists a finite group G which is…

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…

A subset S of a finite group G invariably generates G if G = <hsg(s) j s 2 Si > for each choice of g(s) 2 G; s 2 S. We give a tight upper bound on the minimal size of an invariable generating set for an arbitrary finite group G. In response…

Let $G$ be a finite almost simple group. It is well known that $G$ can be generated by 3 elements, and in previous work we showed that 6 generators suffice for all maximal subgroups of $G$. In this paper we consider subgroups at the next…

For a finite group $G$, let $d(G)$ denote the minimal number of elements required to generate $G$. In this paper, given a finite almost simple group $G$ and any maximal subgroup $H$ of $G$, we determine a precise upper bound for $d(H)$. In…

Assume that all the Sylow subgroups of a finite group $G$ can be generated by $d$ elements. Then the expected number of elements of $G$ which have to be drawn at random, with replacement, before a set of generators is found, is at most…

We present a sharp upper bound for the number of generators of a finite group in terms of the ratio between the order and the exponent.

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…

Let $F$ be a field and let $E$ be an \'etale algebra over $F$, that is, a finite product of finite separable field extensions $E = F_1 \times \dots \times F_r$. The classical primitive element theorem asserts that if $r = 1$, then $E$ is…

By using the structure and some properties of extraspecial and generalized/almost extraspecial $p$-groups, we explicitly determine the number of elements of specific orders in such groups. As a consequence, one may find the number of cyclic…

We prove that every finite simple group of Lie type $G$ can be generated by three regular unipotent elements. In certain cases we show that two regular unipotents are sufficient to generate $G$.

The generalized order $e_G(g)$ of an element $g$ of a group $G$ is the smallest positive integer $k$ such that there exist $x_1,\ldots,x_k \in G$ such that $g^{x_1} \ldots g^{x_k}=1$, where $g^x=x^{-1}gx$. Let $e(G) = \max \{e_G(g)\ |\ g…

Let $G$ be 2-generated group. The generating graph $\Gamma(G)$ of $G$ is the graph whose vertices are the elements of $G$ and where two vertices $g$ and $h$ are adjacent if $G = \langle g, h \rangle.$ This definition can be extended to a…

Denote by $m(G)$ the largest size of a minimal generating set of a finite group $G$. We estimate $m(G)$ in terms of $\sum_{p\in \pi(G)}d_p(G),$ where we are denoting by $d_p(G)$ the minimal number of generators of a Sylow $p$-subgroup of…

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…

Let $G$ be a finite 2-generated soluble group and suppose that $\langle a_1,b_1\rangle=\langle a_2,b_2\rangle=G$. If either $G^\prime$ is of odd order or $G^\prime$ is nilpotent, then there exists $b \in G$ with $\langle…

The dead-end depth of an element g of a group G, with respect to a generating set A is the distance from g to the complement of the radius $d_A(1,g)$ closed ball, in the word metric $d_A$ defined with respect to A. We exhibit a finitely…

In this paper we measure how efficiently a finite simple group $G$ is generated by its elements of order $p$, where $p$ is a fixed prime. This measure, known as the $p$-width of $G$, is the minimal $k\in \mathbb{N}$ such that any $g\in G$…

We investigate the extent to which the exchange relation holds in finite groups $G$. We define a new equivalence relation $\equiv_{\mathrm{m}}$, where two elements are equivalent if each can be substituted for the other in any generating…