Related papers: On the widths of finite groups (I)

Suppose that G is a linearly reductive group. We study the minimal free resolution of the invariant ring. If G is a finite linearly reductive group, then the ring of invariants is generated in degree at most |G|, the group order. We prove…

The prime graph (or Gruenberg-Kegel graph) of a finite group $G$ is a familiar graph. In this paper first, we investigate the structure of the finite groups with a non-complete prime graph. Then we prove that every alternating group…

A $p$-subgroup $H$ of a finite group $G$ is said to satisfy partial $S$-$\Pi$-property in $G$ if $G$ has a chief series $\Gamma_{G}: 1=G_{0}<G_{1}<\cdots<G_{n}=G$ such that for every $G$-chief factor $G_{i}/G_{i-1}$ $(1\leqslant i\leqslant…

We answer three questions posed in a paper by Babson and Benjamini. They introduced a parameter $C_G$ for Cayley graphs $G$ that has significant application to percolation. For a minimal cutset of $G$ and a partition of this cutset into two…

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…

Let G be a group. We say that G has spread r if for any set of distinct elements {x1,..., xr}\subset G there exists an element y\in G with the property that <xi, y>=G for every 0<i<r+1. Few bounds on the spread of finite simple groups are…

Let $A=\{a_1,a_2,\dots, a_m\}$ be a subset of a finite abelian group $G$. We call $A$ {\it $t$-independent} in $G$, if whenever $$\lambda_1a_1+\lambda_2a_2+\cdots +\lambda_m a_m=0$$ for some integers $\lambda_1, \lambda_2, \dots ,…

Let $G$ be a finite group and $\pi$ be a set of primes. We show that if the number of conjugacy classes of $\pi$-elements in $G$ is larger than $5/8$ times the $\pi$-part of $|G|$ then $G$ possesses an abelian Hall $\pi$-subgroup which…

The Wiener index $W(G)$ of a graph $G$ is one of the most well-known topological indices, which is defined as the sum of distances between all pairs of vertices of $G$. The diameter $D(G)$ of $G$ is the maximum distance between all pairs of…

Let $\pi$ be a set of primes containing $2$ and an odd prime $p$. It is proved that if a finite group $G$ has a Hall $\pi$-subgroup $H$, then the non-$p$-soluble length of $G$ is bounded above by the generalized Fitting height of $H$. The…

Let G be a finite group with a generating set A. By the (symmetric) diameter of G with respect to A we mean the maximum over g in G of the length of the shortest word in (A union A inverse)A expressing g.By the (symmetric) diameter of G we…

Let $\Gamma$ be an undirected and simple graph. A set $ S $ of vertices in $\Gamma$ is called a {cyclic vertex cutset} of $\Gamma$ if $\Gamma - S$ is disconnected and has at least two components each containing a cycle. If $\Gamma$ has a…

Let $G$ be the first Grigorchuk group. We show that the commutator width of $G$ is $2$: every element $g\in [G,G]$ is a product of two commutators, and also of six conjugates of $a$. Furthermore, we show that every finitely generated…

In a finite real reflection group, the reflection length of each element is equal to the codimension of its fixed space, and the two coincident functions determine a partial order structure called the absolute order. In complex reflection…

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) =…

The Difference graph $\mathcal{D}(G)$ of a finite group $G$ is the difference of the enhanced power graph $\mathcal{P}_{E}(G)$ and the power graph $\mathcal{P}(G)$ with all the isolated vertices removed. In this paper, we characterize the…

We study the girth of Cayley graphs of finite classical groups G on random sets of generators. Our main tool is an essentially best possible bound we obtain on the probability that a given word w takes the value 1 when evaluated in G in…

The spectrum of a finite group is the set of its elements orders. Groups are said to be isospectral if their spectra coincide. For every finite simple exceptional group $L=E_7(q)$, we prove that each finite group isospectral to $L$ is…

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…

We define $g(n)$ to be the maximal order of an element of the symmetric group on $n$ elements. Results about the prime factorization of $g(n)$ allow a reduction of the upper bound on the largest prime divisor of $g(n)$ to $1.328\sqrt{n\log…