Related papers: Random Generation of the Special Linear Group

Let $V:=(\mathbb{F}_q)^d$ be a $d$-dimensional vector space over the field $\mathbb{F}_q$ of order $q$. Fix positive integers $e_1,e_2$ satisfying $e_1+e_2=d$. Motivated by analysing a fundamental algorithm in computational group theory for…

We study random generation in the symmetric group when cycle type restrictions are imposed. Given $\pi, \pi' \in S_n$, we prove that $\pi$ and a random conjugate of $\pi'$ are likely to generate at least $A_n$ provided only that $\pi$ and…

Let $g$, $h$ be a random pair of generators of $G=Sym(n)$ or $G=Alt(n)$. We show that, with probability tending to $1$ as $n\to \infty$, (a) the diameter of $G$ with respect to $S = \{g,h,g^{-1},h^{-1}\}$ is at most $O(n^2 (\log n)^c)$, and…

Let $R$ be a ring generated by $l$ elements with stable range $r$. Assume that the group $EL_d(R)$ has Kazhdan constant $\epsilon_0>0$ for some $d > r $. We prove that there exist $\epsilon(\epsilon_0,l) >0$ and $k \in N$, s.t. for every $n…

Let $G$ be the special linear group $\mathrm{SL}(2,q)$. We show that if $(a_1,\ldots,a_t)$ and $(b_1,\ldots,b_t)$ are sampled uniformly from large subsets $A$ and $B$ of $G^t$ then their interleaved product $a_1 b_1 a_2 b_2 \cdots a_t b_t$…

In earlier work, Katz exhibited some very simple one parameter families of exponential sums which gave rigid local systems on the affine line in characteristic p whose geometric (and usually, arithmetic) monodromy groups were SL(2,q), and…

We study the numbers of involutions and their relation to Frobenius-Schur indicators in the groups $\mathrm{SO}^{\pm}(n,q)$ and $\Omega^{\pm}(n,q)$. Our point of view for this study comes from two motivations. The first is the conjecture…

Every nonabelian finite simple group of rank $n$ over a field of size $q$, with the possible exception of the Ree groups $^2G_2(3^{2e+1})$, has a presentation with a bounded number of generators and relations and total length $O(\log n…

It is described the group of arrowy permutations (that is extension of symmetric group) and the consequent process of generation of GL(n) and some its subgroups by this combinatoric group and its subgroups.

We analyze a random greedy process to construct $q$-uniform linear hypergraphs using the differential equation method. We show for $q=o(\sqrt{\log n})$, that this process yields a hypergraph with $\frac{n(n-1)}{q(q-1)}(1-o(1))$ edges. We…

Let GL(n,q) be the group of nxn invertible matrices over a field with q elements, and SL(n,q) be the group of nxn matrices with determinant 1 over a field with q elements. We prove that the product of any two non-central conjugacy classes…

Let q be a power of a prime and n a positive integer. Let P(q) be a parabolic subgroup of the finite general linear group GL(n,q). We show that the number of P(q)-conjugacy classes in GL(n,q) is, as a function of q, a polynomial in q with…

Let $G$ be a finite $2$-generated non-cyclic group. The spread of $G$ is the largest integer $k$ such that for any nontrivial elements $x_1, \ldots, x_k$, there exists $y \in G$ such that $G = \langle x_i, y\rangle$ for all $i$. The more…

De Loera, O'Neill and Wilburne introduced a general model for random numerical semigroups in which each positive integer is chosen independently with some probability p to be a generator, and proved upper and lower bounds on the expected…

Let $\Lambda = \mathrm{SL}_2(\Bbb Z)$ be the modular group and let $c_n(\Lambda)$ be the number of congruence subgroups of $\Lambda$ of index at most $n$. We prove that $\lim\limits_{n\to \infty} \frac{\log c_n(\Lambda)}{(\log n)^2/\log\log…

Let $ \nu $ be a probability distribution over the linear semi-group $ \mathrm{End}(E) $ for $ E $ a finite dimensional vector space over a locally compact field. We assume that $ \nu $ is proximal, strongly irreducible and that $…

We present unpublished work of D.Carter, G.Keller, and E.Paige on bounded generation in special linear groups. Let n be a positive integer, and let A = O be the ring of integers of an algebraic number field K (or, more generally, let A be a…

Under suitable conditions on a family $(I(t))_{t\ge 0}$ of Lipschitz mappings on a complete metric space, we show that up to a subsequence the strong limit $S(t):=\lim_{n\to\infty}(I(t 2^{-n}))^{2^n}$ exists for all dyadic time points $t$,…

We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertices of its representation by a reduced graph such as can be…

For every positive integer $n$ and for every $\alpha \in [0, 1]$, let $\mathcal{B}(n, \alpha)$ denote the probabilistic model in which a random set $\mathcal{A} \subseteq \{1, \dots, n\}$ is constructed by picking independently each element…