Related papers: Invariable generation of finite classical groups

We investigate the proportion of fixed point free permutations (derangements) in finite transitive permutation groups. This article is the first in a series where we prove a conjecture of Shalev that the proportion of such elements is…

We show that connected separable locally compact groups are infinitesimally finitely generated, meaning that there is an integer $n$ such that every neighborhood of the identity contains $n$ elements generating a dense subgroup. We…

Let $X$ be a centered random variable with unit variance, zero third moment, and such that $E[X^4] \ge 3$. Let $\{F_n : n\geq 1\}$ denote a normalized sequence of homogeneous sums of fixed degree $d\geq 2$, built from independent copies of…

A family of sets is called $r$-\emph{cover free} if no set in the family is contained in the union of $r$ (or less) other sets in the family. A $1$-cover free family is simply an antichain with respect to set inclusion. Thus, Sperner's…

The conjugacy problem for a finitely generated group $G$ is the two-variable problem of deciding for an arbitrary pair $(u,v)$ of elements of $G$, whether or not $u$ is conjugate to $v$ in $G$. We construct examples of finitely generated,…

A generating set $S$ for a group $G$ is independent if the subgroup generated by $S\setminus \{s\}$ is properly contained in $G$, for all $s \in S.$ In this paper, we study a problem proposed by Peter Glasby: we investigate finite groups,…

In recent years there has been significant progress in the study of products of subsets of finite groups and of finite simple groups in particular. In this paper we consider which families of finite simple groups $G$ have the property that…

We study $6$-transposition groups, i.e. groups generated by a normal set of involutions $D$, such that the order of the product of any two elements from $D$ does not exceed $6$. We classify most of the groups generated by $3$ elements from…

We construct an infinite finitely generated recursively presented residually finite algorithmically finite group $G$ answering thereby a question of Myasnikov and Osin. Moreover, $G$ is "very infinite" and "very algorithmically finite" in…

Given a finite group $G$, we denote by $\nu(G)$ the probability that two randomly chosen elements of $G$ generate a nilpotent subgroup. We prove that if $\nu(G)>1/12,$ then $G$ is solvable.

We study a characteristic subgroup of finitely generated groups, consisting of elements with uniform upper bound for word-lengths. For a group $G$, we denote this subgroup by $G_{bound}$. We give sufficient criteria for triviality and…

We answer a question raised by Lanier about the possibility of generating $A_n$ and $S_n$ with two elements of order $k$, where $n \geqslant k \geqslant 3$. We show that this can always be done apart from some clear exceptions.

In 1995, Isaacs, Kantor and Spaltenstein proved that for a finite simple classical group G defined over a field with q elements, and for a prime divisor p of |G| distinct from the characteristic, the proportion of p-singular elements in G…

In this article we consider the cycle structure of compositions of pairs of involutions in the symmetric group S_n chosen uniformly at random. These can be modeled as modified 2-regular graphs, giving rise to exponential generating…

For two collections of nonnegative and suitably normalised weights $\W=(\W_j)$ and $\V=(\V_{n,k})$, a probability distribution on the set of partitions of the set $\{1,...,n\}$ is defined by assigning to a generic partition $\{A_j, j\leq…

Let $G$ be a simple algebraic group over an algebraically closed field and let $X$ be an irreducible subvariety of $G^r$ with $r \geqslant 2$. In this paper, we consider the general problem of determining if there exists a tuple $(x_1,…

Let $G$ be a transitive permutation group acting on a finite set $\Omega$ with $|\Omega|\geqslant 2$. An element of $G$ is said to be a derangement if it has no fixed points on $\Omega$, and by a theorem of Jordan from 1872, $G$ always…

We say that a finite group $G$ satisfies the independence property if, for every pair of distinct elements $x$ and $y$ of $G$, either $\{x,y\}$ is contained in a minimal generating set for $G$ or one of $x$ and $y$ is a power of the other.…

The aim of the article is to show that there are many finite extensions of arithmetic groups which are not residually finite. Suppose $G$ is a simple algebraic group over the rational numbers satisfying both strong approximation, and the…

A group $G$ given by a presentation $G = < \mathcal A \| \mathcal R >$ is called weakly finitely presented if every finitely generated subgroup of $G$, generated by (images of) some words in $\mathcal A^{\pm 1}$, is naturally isomorphic to…