Related papers: Generating sets of finite groups

Let $G$ be a finite group, and let $d$ be the degree of an irreducible character of $G$ such that $|G|=d(d+e)$ for some $e>1$. Consider the case when $G$ is solvable, $d$ is square-free, and $(d,d+e)=1$. We wish to explore an equivalent…

Given a finite graph G there is a corresponding group given by the presentation with generators the vertices of G and a relation [x,y]=1 for generators x and y precisely when (x,y) is an edge of G. Such groups are known as partially…

Let $G$ be a group. A group is said to be $k$-generated if it can be generated by its $k$ elements. A generating set of $G$ is called a minimal generating set if no proper subset of it generates $G.$ A minimal generating set of a group can…

We prove that the invariably generating graph of a finite group can have an arbitrarily large number of connected components with at least two vertices.

We prove that if $G$ is a finite primitive permutation group and if $g$ is an element of $G$, then either $g$ has a cycle of length equal to its order, or for some $r$, $m$ and $k$, the group $G \leq \mathrm{Sym}(m) \textrm{wr}…

A subgroup Q is commensurated in a group G if each G conjugate of Q intersects Q in a group that has finite index in both Q and the conjugate. So commensurated subgroups are similar to normal subgroups. Semistability and simple connectivity…

In this note we study sets of normal generators of finitely presented residually $p$-finite groups. We show that if an infinite, finitely presented, residually $p$-finite group $G$ is normally generated by $g_1,\dots,g_k$ with order…

Suppose that $\tilde{G}$ is a connected reductive group defined over a field $k$, and $\Gamma$ is a finite group acting via $k$-automorphisms of $\tilde{G}$ satisfying a certain quasi-semisimplicity condition. Then the connected part of the…

The rank of a point-line geometry G is usually defined as the generating rank of G, namely the minimal cardinality of a generating set. However, when the subspace lattice of G satisfies the Exchange Property we can also try a different…

The congruence subgroup problem for a finitely generated group $\Gamma$ and $G\leq Aut(\Gamma)$ asks whether the map $\hat{G}\to Aut(\hat{\Gamma})$ is injective, or more generally, what is its kernel $C\left(G,\Gamma\right)$? Here $\hat{X}$…

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.

This paper introduces the concept of a generating set for stochastic matrices -- a subset of matrices whose repeated composition generates the entire set. Understanding such generating sets requires specifying the "indivisible elements" and…

A group $G$ is said to be $\frac{3}{2}$-generated if every nontrivial element belongs to a generating pair. It is easy to see that if $G$ has this property then every proper quotient of $G$ is cyclic. In this paper we prove that the…

For modules over group rings we introduce the following numerical parameter. We say that a module A over a ring R has finite r-generator property if each f.g. (finitely generated) R-submodule of A can be generated exactly by r elements and…

We provide lower estimates on the minimal number of generators of the profinite completion of free products of finite groups. In particular, we show that if C_1,...,C_n are finite cyclic groups then there exists a finite group G which is…

Many groups possess highly symmetric generating sets that are naturally endowed with an underlying combinatorial structure. Such generating sets can prove to be extremely useful both theoretically in providing new existence proofs for…

The generating graph $\Gamma(G)$ of a finite group $G$ has vertex set the non-identity elements of $G$, with two elements connected exactly when they generate $G$. A coclique in a graph is an empty induced subgraph, so a coclique in…

We show that for some absolute (explicit) constant $C$, the following holds for every finitely generated group $G$, and all $d >0$: If there is some $ R_0 > \exp(\exp(Cd^C))$ for which the number of elements in a ball of radius $R_0$ in a…

Let $\psi(G) = \sum_{g \in G} o(g)$ denote the sum of element orders of a finite group $G$. It is known that among groups of order $n$, the cyclic group $C_n$ maximizes $\psi$. T\u{a}rn\u{a}uceanu proved that two finite abelian $p$-groups…

We fix a field $\kk$ of characteristic $p$. For a finite group $G$ denote by $\delta(G)$ and $\sigma(G)$ respectively the minimal number $d$, such that for any finite dimensional representation $V$ of $G$ over $\kk$ and any $v\in…