Related papers: Groups with exactly two supercharacter theories

We study the zero-sharing behavior among irreducible characters of a finite group. For symmetric groups $S_n$, it is proved that, with one exception, any two irreducible characters have at least one common zero. To further explore this…

We study embeddings of $\mathrm{PSL}_2(p^a)$ into exceptional groups $G(p^b)$ for $G=F_4,E_6,{}^2\!E_6,E_7$, and $p$ a prime with $a,b$ positive integers. With a few possible exceptions, we prove that any almost simple group with socle…

We show that the groups AGL_n(Q) and PGL_n(Q), seen as closed subgroups of S_{\infty}, are maximal-closed.

An abstract group $G$ is called totally $2$-closed if $H=H^{(2),\Omega}$ for any set $\Omega$ with $G\cong H\leq{\rm Sym}(\Omega)$, where $H^{(2),\Omega}$ is the largest subgroup of ${\rm Sym}(\Omega)$ whose orbits on $\Omega\times\Omega$…

In this paper we show that if $n\geq 5$ and $G$ is any of the groups $SU_n(q)$ with $n\neq 6,$ $Sp_{2n}(q)$ with $q$ odd, $\Omega_{2n+1}(q),$ $\Omega_{2n}^{\pm}(q),$ then $G$ and the simple group $\barG=G/Z(G)$ are not 2-coverable. Moreover…

In this work, we classify all finite groups such that for every field extension F of \mathbb{Q}, F is the field of values of at most 3 irreducible characters.

We investigate prime character degree graphs of solvable groups that have six vertices. There are one hundred twelve non-isomorphic connected graphs with six vertices, of which all except nine are classified in this paper. We also…

J. G. Thompson showed that a finite group G is solvable if and only if every two -generated subgroup is solvable. Recently, Grunevald, Kunyavskii, Nikolova, and Plotkin have shown that the analogue holds for finite-dimensional Lie algebras…

Finite groups with very few character values are characterized. The following is the main result of this article: a finite non-abelian group has precisely four character values if and only if it is the generalized dihedral group of a…

We show that, if $w_1, \ldots , w_6$ are words which are not an identity of any (non-abelian) finite simple group, then $w_1(G)w_2(G) \cdots w_6(G) = G$ for all (non-abelian) finite simple groups $G$. In particular, for every word $w$,…

For a semigroup $S$, the covering number of $S$ with respect to semigroups, $\sigma_s(S)$, is the minimum number of proper subsemigroups of $S$ whose union is $S$. This article investigates covering numbers of semigroups and analogously…

In this paper, we proved that a group $G$ is supersoluble if and only if for any prime $p\in \pi (G)$ there exists a supersoluble subgroup of index $p$.

The spectrum $\omega(G)$ of a finite group $G$ is the set of orders of its elements. The following sufficient criterion of nonsolvability is proved: if among the prime divisors of the order of a group $G$, there are four different primes…

We prove a variation of Thompson's Theorem. Namely, if the first column of the character table of a finite group $G$ contains only two distinct values not divisible by a given prime number $p>3$, then $O^{pp'pp'}(G)=1$. This is done by…

For a finite group $G$, the prime graph $\Gamma(G)$ (also known as Gruenberg-Kegel graph) is defined to be the graph where the vertices are the primes that divide $|G|$ such that two vertices $p$ and $q$ share an edge if and only if there…

A subgroup $A$ of a group~$G$ is said to be {\sl NS-supplemented} in $G$, if there exists a subgroup~$B$ of $G$ such that $G=AB$ and whenever $X$~is a normal subgroup of~$A$ and $p\in \pi(B)$, there exists a Sylow $p$-subgroup~$B_p$ of~$B$…

In this paper, we study the structures of finite groups using some arithmetic conditions on the sizes of real conjugacy classes. We prove that a finite group is solvable if the prime graph on the real class sizes of the group is…

For a number field K, we show that any S-arithmetic subgroup of SL_2(K) contains a subgroup of finite index generated by three elements if card(S)> 1.

We exhibit infinitely many natural numbers $n$ for which there exists at least one insolvable group of order $n$, and yet the holomorph of any solvable group of order $n$ has no insolvable regular subgroup. We also solve Problem 19.90 (d)…

In 1962, V.A. Belonogov proved that if a finite group $G$ contains two maximal subgroups of coprime orders, then either $G$ is one of known solvable groups or $G$ is simple. In this short note based on results by M. Liebeck and J. Saxl on…