Related papers: Finite groups, minimal bases and the intersection …

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…

For a finite group $G$, let $\sigma(G)$ be the number of subgroups of $G$ and $\sigma_\iota(G)$ the number of isomorphism types of subgroups of $G$. Let $L=L_r(p^e)$ denote a simple group of Lie type, rank $r$, over a field of order $p^e$…

For a positive integer $k$, a group $G$ is said to be totally $k$-closed if for each set $\Omega$ upon which $G$ acts faithfully, $G$ is the largest subgroup of $\mathrm{Sym}(\Omega)$ that leaves invariant each of the $G$-orbits in the…

Let $G$ be a finite insoluble group with soluble radical $R(G)$. In this paper we investigate the soluble graph of $G$, which is a natural generalisation of the widely studied commuting graph. Here the vertices are the elements in $G…

A base for a permutation group $G$ acting on a set $\Omega$ is a subset $\mathcal{B}$ of $\Omega$ such that the pointwise stabiliser $G_{(\mathcal{B})}$ is trivial. Let $n$ and $r$ be positive integers with $n>2r$. The symmetric and…

Let $\Gamma(G)$ be the Gruenberg-Kegel graph of a finite group $G$. We prove that if $G$ is solvable and $\sigma$ is a cut-set for $\Gamma(G)$, then $G$ has a $\sigma$-series of length $5$ whose factors are controlled. As a consequence, we…

We introduce the notion of the depth of a finite group $G$, defined as the minimal length of an unrefinable chain of subgroups from $G$ to the trivial subgroup. In this paper we investigate the depth of (non-abelian) finite simple groups.…

Let $G$ be a finite group, let $\pi(G)$ be the set of prime divisors of $|G|$ and let $\Gamma(G)$ be the prime graph of $G$. This graph has vertex set $\pi(G)$, and two vertices $r$ and $s$ are adjacent if and only if $G$ contains an…

A result of Pyber states that every finite group $G$ contains an abelian subgroup whose order is quasi-polynomially large in $\lvert G\rvert$. We prove a similar result for $K$-approximate subgroups of solvable groups under only modest…

Let $V$ be a vector space of dimension $d$ over $F_q$, a finite field of $q$ elements, and let $G \le GL(V) \cong GL_d(q)$ be a linear group. A base of $G$ is a set of vectors whose pointwise stabiliser in $G$ is trivial. We prove that if…

A family $\mathcal{F}$ of $k$-subsets of an $n$-set is called $s$-almost $t$-intersecting if each member is $t$-disjoint with at most $s$ members. In this paper, we prove that, if $\left|\mathcal{F}\right|$ is maximum, then $\mathcal{F}$…

The \emph{difference subgroup graph} $D(G)$ of a finite group $G$ is defined as the graph whose vertices are the non-trivial proper subgroups of $G$, with two distinct vertices $H$ and $K$ adjacent if and only if $\langle H, K \rangle = G$…

Motivated in part by representation theoretic questions, we prove that if G is a finite quasi-simple group, then there exists an elementary abelian subgroup of G that intersects every conjugacy class of involutions of G.

A finite abelian group $G$ of cardinality $n$ is said to be of type III if every prime divisor of $n$ is congruent to 1 modulo 3. We obtain a classification theorem for sum-free subsets of largest possible cardinality in a finite abelian…

The power graph $\mathcal{P}(G)$ of a group $G$ is the simple graph with vertex set $G$ and two vertices are adjacent whenever one of them is a positive power of the other. In this paper, for a finite noncyclic nilpotent group $G$, we study…

Let $\Cr_\Q(2)$ be the Cremona group of rank $2$ over rational numbers. we give a classification of large finite subgroups $G$ of $\Cr_\Q(2)$ and give a new sharp bound smaller (but not multiplicative) than $M(\Q)=120960 =…

Let $G$ be a finite almost simple group with socle $G_0$. A (nontrivial) factorization of $G$ is an expression of the form $G=HK$, where the factors $H$ and $K$ are core-free subgroups. There is an extensive literature on factorizations of…

A cover of a finite group $G$ is a family of proper subgroups of $G$ whose union is $G$, and a cover is called minimal if it is a cover of minimal cardinality. A partition of $G$ is a cover such that the intersection of any two of its…

A cyclic subgroup $N$ of a finite group $G$ is called a uni-width subgroup of $G$ if $N$ is the unique cyclic subgroup of $G$ of order $|N|$. In this article, we prove that a finite group $G$ admits a unique largest uni-width subgroup…

Let $G$ be a simple graph with $2n$ vertices and a perfect matching. We denote by $f(G)$ and $F(G)$ the minimum and maximum forcing number of $G$, respectively. Hetyei obtained that the maximum number of edges of graphs $G$ with a unique…