Related papers: Random Generation of the Special Linear Group
The First Fundamental Theorem of Invariant Theory describes a minimal generating set of the invariant polynomial ring under the action of some group $G$. In this note we give an elementary and direct proof for the $\operatorname{GL}_2(K)$…
We prove that if a linear group $\Gamma \subset \mathrm{GL}_n(K)$ over a field $K$ of characteristic zero is boundedly generated by semi-simple (diagonalizable) elements then it is virtually solvable. As a consequence, one obtains that…
We consider GL_n(F_q)-analogues of certain factorization problems in the symmetric group S_n: rather than counting factorizations of the long cycle (1, 2, ..., n) given the number of cycles of each factor, we count factorizations of a…
The semidirect product $\mathbb{G}=\mathbb{L}\rtimes \mathbb{K}$ attached to a compact-group action on a connected, simply-connected solvable Lie group has a dense set of compact elements precisely when the $s\in \mathbb{K}$ operating on…
The complete classification of the finite simple groups that are $(2,3)$-generated is a problem which is still open only for orthogonal groups. Here, we construct $(2, 3)$-generators for the finite odd-dimensional orthogonal groups…
The standard $(n, k, d)$ model of random groups is a model where the relators are chosen randomly from the set of cyclically reduced words of length $k$ on an $n$-element generating set. Gromov's density model of random groups considers the…
We investigate refined algebraic quantisation with group averaging in a finite-dimensional constrained Hamiltonian system that provides a simplified model of general relativity. The classical theory has gauge group SL(2,R) and a…
Let $A$ be an arbitrary symmetrizable Cartan matrix of rank $r$, and ${\bf n}={\bf n_+}$ be the standard maximal nilpotent subalgebra in the Kac-Moody algebra associated with $A$ (thus, ${\bf n}$ is generated by $E_1,\ldots,E_r$ subject to…
For a fixed prime power $q$ and natural number $d$ we consider a random polynomial $$f=x^n+a_{n-1}(t)x^{n-1}+\ldots+a_1(t)x+a_0(t)\in\mathbb F_q[t][x]$$ with $a_i$ drawn uniformly and independently at random from the set of all polynomials…
In this paper we compute the difference Galois groups of the Lie-irreducible regular singular generalized q-hypergeometric equations of order 3 with q-real parameters by using a density theorem due to Sauloy. In contrast with the…
The purpose of this paper is to provide an octonionic description of the Lie group $SL(2,{\mathbb O})$. The main result states that it can be obtained as a free group generated by invertible and determinant preserving transformations from…
We consider the distribution of the Galois groups $\operatorname{Gal}(K^{\operatorname{un}}/K)$ of maximal unramified extensions as $K$ ranges over $\Gamma$-extensions of $\mathbb{Q}$ or $\mathbb{F}_q(t)$. We prove two properties of…
Let $ n, q $ be positive integers. We show that if $ G $ is a finitely generated residually finite group satisfying the identity $ [x,_ny^q]\equiv 1, $ then there exists a function $ f(n) $ such that $ G $ has a nilpotent subgroup of finite…
The average order of a finite group G is denoted by o(G). In this note, we classify groups whose average orders are less than o(S4), where S4 is the symmetric group on four elements. Moreover, we prove that G \cong S4 if and only if o(G) =…
We show that a topologically generating set $S$ of a connected compact Lie group $G$ of size larger than a fixed polynomial in the rank of $G$ must be redundant (i.e., some proper subset of $S$ still topologically generates $G$). Similar…
We provide numerical indications of the $q$-generalised central limit theorem that has been conjectured (Tsallis 2004) in nonextensive statistical mechanics. We focus on $N$ binary random variables correlated in a {\it scale-invariant} way.…
We say that permutations $\pi_1,\dots, \pi_r \in \mathcal{S}_n$ invariably generate $\mathcal{S}_n$ if, no matter how one chooses conjugates $\pi'_1,\dots,\pi'_r$ of these permutations, $\pi'_1,\dots,\pi'_r$ generate $\mathcal{S}_n$. We…
Uhlenbeck proved that a set of simple elements generates the group of rational loops in GL(n,C) that satisfy the U(n)-reality condition. For an arbitrary complex reductive group, a choice of representation defines a notion of rationality…
We establish that standard arithmetic subgroups of a special orthogonal group ${\rm SO}(1,n)$ are conjugacy separable. As an application we deduce this property for unit groups of certain integer group rings. We also prove that finite…
A random algebraic graph is defined by a group $G$ with a uniform distribution over it and a connection $\sigma:G\longrightarrow[0,1]$ with expectation $p,$ satisfying $\sigma(g)=\sigma(g^{-1}).$ The random graph…