Related papers: Random Generation of the Special Linear Group

We give analogues in the finite general linear group of two elementary results concerning long cycles and transpositions in the symmetric group: first, that the long cycles are precisely the elements whose minimum-length factorizations into…

Let $L_n(k)$ denote the least common multiple of $k$ independent random integers uniformly chosen in $\{1,2,\ldots ,n\}$. In this note, using a purely probabilistic approach, we derive a criterion for the convergence in distribution as…

In this paper, we introduce a novel approach for generating random elements of a finite group given a set of generators of that. Our method draws upon combinatorial group theory and automata theory to achieve this objective. Furthermore, we…

Let M=M(n,q) be the average of the orders of the elements in the finite unitary group U(n,q). The asymptotic estimate log(M)=nlog(q)-log(n) +o(log n) is proved.

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…

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…

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 for a number field $F$, the distribution of the points of a set $\Sigma \subset \mathbb{A}_F^n$ with a purely exponential parametrization, for example a set of matrices boundedly generated by semi-simple (diagonalizable)…

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…

Let $F[X]$ be the polynomial ring over a finite field $F$. It is shown that, for $n\geq 3$, the special linear group $SL_n(F[X])$ is boundedly generated by the elementary matrices.

The classical Gaussian ensembles of random matrices can be constructed by maximizing Boltzmann-Gibbs-Shannon's entropy, S_{BGS} = - \int d{\bf H} [P({\bf H})] \ln [P({\bf H})], with suitable constraints. Here we construct and analyze…

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

Consider the random Cayley graph of a finite group $G$ with respect to $k$ generators chosen uniformly at random, with $1 \ll k \lesssim \log |G|$. The results of this article supplement those in the three main papers on random Cayley…

Suppose $\pi$ and $\pi'$ are two random elements of $S_n$ with constrained cycle types such that $\pi$ has $x n^{1/2}$ fixed points and $yn/2$ two-cycles, and likewise $\pi'$ has $x' n^{1/2}$ fixed points and $y'n/2$ two-cycles. We show…

This paper is a new important step towards the complete classification of the finite simple groups which are $(2, 3)$-generated. In fact, we prove that the symplectic groups $Sp_{2n}(q)$ are $(2,3)$-generated for all $n\geq 4$. Because of…

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…

Special orthogonal matrices with rational elements form the group SO(n,Q), where Q is the field of rational numbers. A theorem describing the structure of an arbitrary matrix from this group is proved. This theorem yields an algorithm for…

We first give a short group theoretic proof of the following result of Lackenby. If $G$ is a large group, $H$ is a finite index subgroup of $G$ admitting an epimorphism onto a non--cyclic free group, and $g$ is an element of $H$, then the…

We determine the distribution of the sandpile group (a.k.a. Jacobian) of the Erd\H{o}s-R\'enyi random graph G(n,q) as n goes to infinity. Since any particular group appears with asymptotic probability 0 (as we show), it is natural ask for…

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…