Related papers: On the probability of generating invariably a fini…

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…

We prove that if G is a sufficiently large finite almost simple group of Lie type, then given a fixed nontrivial element x in G and a coset of G modulo its socle, the probability that x and a random element of the coset generate a subgroup…

A subset of a group invariably generates the group if it generates even when we replace the elements by any of their conjugates. In a 2016 paper, Pemantle, Peres and Rivin show that the probability that four randomly selected elements…

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…

Famously, every finite simple group $G$ can be generated by a pair of elements. Moreover, Liebeck and Shalev (1995) proved that the probability that a pair of elements generate $G$ tends to $1$ as $|G| \to \infty$. More generally, work of…

Let $G$ be a simple algebraic group over the algebraic closure of $GF(p)$ ($p$ prime), and let $G(q)$ denote a corresponding finite group of Lie type over $GF(q)$, where $q$ is a power of $p$. Let $X$ be an irreducible subvariety of $G^r$…

A subset $\{g_1, \ldots , g_d\}$ of a finite group $G$ invariably generates $G$ if $\{g_1^{x_1}, \ldots , g_d^{x_d}\}$ generates $G$ for every choice of $x_i \in G$. The Chebotarev invariant $C(G)$ of $G$ is the expected value of the random…

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…

A subset $\{g_1, \ldots , g_d\}$ of a finite group $G$ invariably generates $G$ if $\{g_1^{x_1}, \ldots , g_d^{x_d}\}$ generates $G$ for every choice of $x_i \in G$. The Chebotarev invariant $C(G)$ of $G$ is the expected value of the random…

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$.

A subset $S$ of a group $G$ invariably generates $G$ if, when each element of $S$ is replaced by an arbitrary conjugate, the resulting set generates $G.$ An invariable generating set $X$ of $G$ is called minimal if no proper subset of $X$…

Let $G$ be a finite simple group of Lie type and let $P$ be a Sylow $2$-subgroup of $G$. In this paper, we prove that for any nontrivial element $x \in G$, there exists $g \in G$ such that $G = \langle P, x^g \rangle$. By combining this…

We prove that if $G$ is a finite simple group of Lie type and $S$ a subset of $G$ of size at least two then $G$ is a product of at most $c\log|G|/\log|S|$ conjugates of $S$, where $c$ depends only on the Lie rank of $G$. This confirms a…

In 2001 Liebeck and Pyber showed that a finite simple group of Lie type is a product of $ 25 $ carefully chosen unipotent Sylow subgroups. Later, in a series of works it was shown that $ 4 $ unipotent Sylow subgroups suffice. We prove that…

A subset $\{g_1, \ldots , g_d\}$ of a finite group $G$ is said to invariably generate $G$ if the set $\{g_1^{x_1}, \ldots, g_d^{x_d}\}$ generates $G$ for every choice of $x_i \in G$. The Chebotarev invariant $C(G)$ of $G$ is the expected…

It is well known that every finite simple group can be generated by two elements and this leads to a wide range of problems that have been the focus of intensive research in recent years. In this survey article we discuss some of the…

We prove that there exists a finitely generated group that satisfies a group law with probability 1 but does not satisfy any group law. More precisely, we construct a finitely generated group G in which the probability that a random element…

A subset $S$ of a group $G$ invariably generates $G$ if $G= \langle s^{g(s)} | s \in S\rangle$ for every choice of $g(s) \in G,s \in S$. We say that a group $G$ is invariably generated if such $S$ exists, or equivalently if $S=G$ invariably…

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…

We show that every finite simple group is generated invariably by a Sylow subgroup and a cyclic group. It follows that that the order complex of the coset poset of an arbitrary finite group has nontrivial reduced rational homology.