Related papers: Solvabilizer Numbers of Finite Groups

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…

For a character $\chi$ of a finite group $G$, the number cod$(\chi):=|G:\mathrm{ker}(\chi)|/\chi(1)$ is called the codegree of $\chi$.In this paper, we give a solvability criterion for a finite group $G$ depending on the minimum of the…

We prove that there exists a constant $k$ with the property: if $\calC$ is a conjugacy class of a finite group $G$ such that every $k$ elements of $\calC$\ generate a solvable subgroup then $\calC$ generates a solvable subgroup. In…

Every finite group $G$ has a normal series each of whose factors either is soluble or is a direct product of nonabelian simple groups. We define the nonsoluble length $\lambda (G)$ as the minimum number of nonsoluble factors in a series of…

Let $o(G)$ be the average order of a finite group $G$. In this paper, we prove that if $o(G)<\frac{31}{12}$\,, then $G$ is supersolvable. Moreover, we have $o(G)=\frac{31}{12}$ if and only if $G\cong A_4$. We also classify finite groups $G$…

Suppose that $G$ is a finite, transitive, solvable permutation group acting on a set $S$ with $n$ elements. Let $G_0$ be the stabilizer of a point $\alpha \in \Omega$. Define the rank of a permutation group, denoted $r(G),$ as the number of…

A cover of a finite non-cyclic group $G$ is a family $\mathcal{H}$ of proper subgroups of $G$ whose union equals $G$. A cover of $G$ is called minimal if it has minimal size, and irredundant if it does not properly contain any other cover.…

Let $G$ be a finite group and $\psi(G) = \sum_{g \in G} o(g)$, where $o(g)$ denotes the order of $g \in G$. In [M. Herzog, et. al., Two new criteria for solvability of finite groups, J. Algebra, 2018], the authors put forward the following…

We investigate the finite soluble groups $G$ with the following property (replacement property): for every irredundant generating set $\{g_1,\dots,g_m\}$ of maximal size and for any $1\neq g\in G$ there exists an $i\in \{1,\dots,m\}$ so…

Let $G$ be a finite group and $A$ be a normal subgroup of $G$. We denote by $ncc(A)$ the number of $G$-conjugacy classes of $A$ and $A$ is called $n$-decomposable, if $ncc(A)=n$. Set ${\cal K}_G = \{ncc(A)| A \lhd G \}$. Let $X$ be a…

We construct a solvable group G of order 5648590729620 such that the set of element orders of G coincides with that of the simple group S(4,3). This completes the determination of finite simple groups isospectral to solvable groups.

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 classical theorem of R. Baer describes the nilpotent radical of a finite group G as the set of all Engel elements, i.e. elements y in G such that for any x in G the n-th commutator [x,y,...,y] equals 1 for n big enough. We obtain a…

A group $G$ is said to have dense normalizers if each non-empty open interval in its subgroup lattice $L(G)$ contains the normalizer of a certain subgroup of $G$. In this note, we find all finite groups satisfying this property. We also…

For a finite group $G$, let $\psi(G)$ be the sum of the orders of its elements, and define the corresponding normalized sum as $\psi'(G) := \psi(G)/\psi(\mathcal{C}_{|G|})$, where $\mathcal{C}_{|G|}$ is the cyclic group of the same order as…

For a finite group $G$, let $LC(G)$ be the subgroup generated by elements $x$ such that, for all $y \in G$ and all integers $n$, the order of $x^n y$ divides the least common multiple of the orders of $x$ and $y$. This subgroup is a…

The covering number of a group $G$, denoted by $\sigma(G)$, is the size of a minimal collection of proper subgroups of $G$ whose union is $G$. We investigate which integers are covering numbers of groups. We determine which integers $129$…

The study of the complexity of the equation satisfiability problem in finite groups had been initiated by Goldmann and Russell (2002) where they showed that this problem is in polynomial time for nilpotent groups while it is NP-complete for…

There has been some interest on how the average character degree affects the structure of a finite group. We define, and denote by $ \mathrm{anz}(G) $, the average number of zeros of characters of a finite group $ G $ as the number of zeros…

Let G be a finite group. A subgroup M of G is said to be an NR-subgroup if, whenever K is normal in M, then K^G\cap M=K, where K^G is the normal closure of K in G. Using the Classification of Finite Simple Groups, we prove that if every…