Related papers: The probability of generating a uniserial group

Let $G$ be a finite simple group. In this paper we consider the existence of small subsets $A$ of $G$ with the property that, if $y \in G$ is chosen uniformly at random, then with high probability $y$ invariably generates $G$ together with…

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…

We show that for any $n\geq 2$, two elements selected uniformly at random from a \emph{symmetrized} Euclidean ball of radius $X$ in $\textrm{SL}_n(\mathbb Z)$ will generate a thin free group with probability tending to $1$ as $X\rightarrow…

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

It is well known that the proportion of pairs of elements of $\operatorname{SL}(n,q)$ which generate the group tends to $1$ as $q^n\to \infty$. This was proved by Kantor and Lubotzky using the classification of finite simple groups. We give…

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…

A group $G$ is said to be $\frac{3}{2}$-generated if every nontrivial element belongs to a generating pair. It is easy to see that if $G$ has this property then every proper quotient of $G$ is cyclic. In this paper we prove that the…

Let $G$ be a finite group, and let $\kappa(G)$ be the probability that elements $g$, $h\in G$ are conjugate, when $g$ and $h$ are chosen independently and uniformly at random. The paper classifies those groups $G$ such that $\kappa(G) \geq…

The Liebeck-Nikolov-Shalev conjecture [LNS12] asserts that, for any finite simple non-abelian group $G$ and any set $A\subseteq G$ with $|A|\geq 2$, $G$ is the product of at most $N\frac{\log|G|}{\log|A|}$ conjugates of $A$, for some…

This work establishes a new probabilistic bound on the number of elements to generate finite nilpotent groups. Let $\varphi_k(G)$ denote the probability that $k$ random elements generate a finite nilpotent group $G$. For any $0 < \epsilon <…

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…

We study `good elements' in finite $2n$-dimensional classical groups $G$: namely $t$ is a `good element' if $o(t)$ is divisible by a primitive prime divisor of $q^n-1$ for the relevant field order $q$, and $t$ fixes pointwise an $n$-space.…

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…

Liebeck, Nikolov, and Shalev conjectured the existence of an absolute constant $C>0$, such that for every subset $A$ of a finite simple group $G$ with $|A|\ge 2$, there exists $C\log|G|/\log|A|$ conjugates of $A$ whose product is $G$. This…

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…

Liebeck, Nikolov, and Shalev conjectured that for every subset A of a finite simple group S with |A|>1, there exist O( log|S| / log|A| ) conjugates of A whose product is S. This paper is a companion to [Lifshitz: Completing the proof of the…

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

Every finite simple group can be generated by two elements, and in 2000, Guralnick and Kantor resolved a 1962 question of Steinberg by proving that in a finite simple group every nontrivial element belongs to a generating pair. Groups with…

With high probability, among $O(\log n)$ independent randomly selected elements from a finite $n$-dimensional classical group, some pair of elements power to a $2$-element generating set for a naturally embedded classical subgroup of…

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…