Related papers: Short presentations of finite simple groups

The fundamental result of Li, Long, and Srinivasan on approximations of set systems has become a key tool across several communities such as learning theory, algorithms, computational geometry, combinatorics and data analysis. The goal of…

Self-similar groups provide a rich source of groups with interesting properties; e.g., infinite torsion groups (Burnside groups) and groups with an intermediate word growth. Various self-similar groups can be described by a recursive…

A one-relator group is a group $G_r$ that admits a presentation $\langle S \mid r \rangle$ with a single relation $r$. One-relator groups form a rich classically studied class of groups in Geometric Group Theory. If $r \in F(S)'$, the…

Let $\mathcal{O}$ be the ring of integers of a number field, and let $n\geq 3$. This paper studies bi-interpretability of the ring of integers $\mathbb{Z}$ with the special linear group $\text{SL}_n(\mathcal{O})$, the general linear group…

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…

This is an improved version of the talk of the author given at the Antalya Algebra Days VII on May 21, 2005. We present an introduction to the theory of the invariants under the action of GL(n,C) by simultaneous conjugation of d matrices of…

We consider the isomorphism problem for groups specified by their multiplication tables. Until recently, the best published bound for the worst-case was achieved by the n^(log_p n + O(1)) generator-enumeration algorithm. In previous work…

We obtain new explicit pseudorandom generators for several computational models involving groups. Our main results are as follows: 1. We consider read-once group-products over a finite group $G$, i.e., tests of the form $\prod_{i=1}^n…

Consider an arithmetic group $\mathbf{G}(O_S)$, where $\mathbf{G}$ is an affine group scheme with connected, simply connected absolutely almost simple generic fiber, defined over the ring of $S$-integers $O_S$ of a number field $K$ with…

How many generators and relations does ${\mathrm SL}_n({\mathbb F}_q[t, t^{-1}])$ need? In this paper we exhibit its explicit presentation with $9$ generators and $44$ relations. We investigate presentations of affine Kac-Moody groups over…

The normal covering number $\gamma(G)$ of a finite group $G$ is the minimum number of proper subgroups whose conjugates cover the group. We give various estimates for $\gamma(S_n)$ and $\gamma(A_n)$ depending on the arithmetic structure of…

We describe a new type of polycyclic presentations, that we will call refined solvable presentations, for polycyclic groups. These presentations are obtained by refining a series of normal subgroups with abelian sections. These…

Let K be a number field and let A be its ring of integers. Let G be a connected, noncommutative, absolutely almost simple algebraic K-group. If the K-rank of G equals 2, then G(A[t]) is not finitely presented.

We prove that $d(G) \log |G| = O(n^2 \log q)$ for irreducible subgroups $G$ of GL$(n,q)$, and estimate the associated constants. The result is motivated by attempts to bound the complexity of computing the automorphism groups of various…

We give an example of an infinite family of finite groups $G_n$ such that each $G_n$ can be generated by 2 elements and the diameter of every Cayley graph of $G_n$ is $O(\log (| G_{n}|))$. This answers a question of Lubotzky.

We improve the Solovay--Kitaev theorem and algorithm for a general finite, inverse-closed generating set acting on a qudit. Prior versions of the algorithm efficiently find a word of length $O(n^{3+\delta})$ to approximate an arbitrary…

Reversible circuits have been studied extensively and intensively, and have plenty of applications in various areas, such as digital signal processing, cryptography, and especially quantum computing. In 2003, the lower bound $\Omega(2^n…

There are distributed graph algorithms for finding maximal matchings and maximal independent sets in $O(\Delta + \log^* n)$ communication rounds; here $n$ is the number of nodes and $\Delta$ is the maximum degree. The lower bound by Linial…

A novel approach to the finite dimensional representation theory of the entire Lorentz group $\operatorname{O}(1,3)$ is presented. It is shown how the entire Lorentz group may be understood as a semi-direct product between its identity…

The class of finitely presented algebras over a field $K$ with a set of generators $a_{1},\ldots , a_{n}$ and defined by homogeneous relations of the form $a_{1}a_{2}\cdots a_{n} =a_{\sigma (1)} a_{\sigma (2)} \cdots a_{\sigma (n)}$, where…