Related papers: Strongly generating elements in finite and profini…

In this paper we obtain significant bounds for the number of maximal subgroups of a given index of a finite group. These results allow us to give new bounds for the number of random generators needed to generate a finite $d$-generated group…

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

A subset $\{g_1, \ldots , g_d\}$ of a finite group $G$ is said to invariably generate $G$ if the set $\{g_1^{x_1}, \ldots, g_d^{x_d}\}$ generates $G$ for every choice of $x_i \in G$. The Chebotarev invariant $C(G)$ of $G$ is the expected…

We calculate the precise number of r-regular elements in the finite exceptional groups. As a corollary we find that the proportion of r-regular elements is at least 3577/18432 and for all \epsilon>0, there are infinitely finite simple…

This work establishes a new probabilistic bound on the number of elements to generate finite nilpotent groups. Let $\varphi_k(G)$ denote the probability that $k$ random elements generate a finite nilpotent group $G$. For any $0 < \epsilon <…

In this note, we give an upper bound for the number of elements from the interval $[1,p^{1/4e^{1/2}+\epsilon}]$ necessary to generate the finite field $\mathbb{F}_{p}$ with $p$ an odd prime.

Let $G$ be a finite group admitting a coprime automorphism $\alpha$ of order $e$. Denote by $I_G(\alpha)$ the set of commutators $g^{-1}g^\alpha$, where $g\in G$, and by $[G,\alpha]$ the subgroup generated by $I_G(\alpha)$. We study the…

Let $G$ be a finite group generated by $k$ elements. The well-known product replacement algorithm provides an effective method for sampling generating sets of $G$. We study a refinement of this algorithm that is designed to output…

We investigate some properties of the $p$-elements of a profinite group $G$. We prove that if $p$ is odd and the probability that a randomly chosen element of $G$ is a $p$-element is positive, then $G$ contains an open prosolvable subgroup.…

Let $G$ be a group. A subset $D$ of $G$ is a determining set of $G$, if every automorphism of $G$ is uniquely determined by its action on $D$. The determining number of $G$, denoted by $\alpha(G)$, is the cardinality of a smallest…

The spectrum $\omega(G)$ of a finite group $G$ is the set of element orders of $G$. If $\Omega$ is a non-empty subset of the set of natural numbers, $h(\Omega)$ stands for the number of isomorphism classes of finite groups $G$ with…

A finite group $G$ is coprimely-invariably generated if there exists a set of generators $\{g_1, \ldots, g_d\}$ of $G$ with the property that the orders $|g_1|, \ldots, |g_d|$ are pairwise coprime and that for all $x_1, \ldots, x_d \in G$…

If $g\in G$ is a non-trivial element in a residually finite group, then there exists by definition a finite group $Q$ and a homomorphism $\varphi: G \to Q$ such that $\varphi(g) \neq e$. The residual finiteness growth $\text{RF}_G$ of a…

We prove that if G is a sufficiently large finite almost simple group of Lie type, then given a fixed nontrivial element x in G and a coset of G modulo its socle, the probability that x and a random element of the coset generate a subgroup…

A subset of a group invariably generates the group if it generates even when we replace the elements by any of their conjugates. In a 2016 paper, Pemantle, Peres and Rivin show that the probability that four randomly selected elements…

A generating set for a finite group $G$ is said to be minimal if no proper subset generates $G$, and $m(G)$ denotes the maximal size of a minimal generating set for $G$. We prove a conjecture of Lucchini, Moscatiello and Spiga by showing…

A group $G$ is invariably generated (IG) if there is a subset $S \subseteq G$ such that for every subset $S' \subseteq G$, obtained from $S$ by replacing each element with a conjugate, $S'$ generates $G$. $G$ is finitely invariably…

We present two uncountable families of finitely generated residually finite groups all having the same profinite completion. One consists of soluble groups, the other of branch groups.

The function $\mathrm{P}_{\mathbf{v}}(G)$, measuring the proportion of the elements of a finite group $G$ that are zeros of irreducible characters of $G$, takes (as proved in [12]) only values $\frac{m-1}{m}$, for $1 \leq m \leq 6$, in the…

We show that for any $k$ at least $6$ and $g$ sufficiently large, the mapping class group of a surface of genus $g$ can be generated by three elements of order $k$. We also show that this can be done with four elements of order $5$. We…