Searcharxiv⌕ Search

arXiv subjects

Zeinab Akhlaghi

Publications and source records attributed to Zeinab Akhlaghi.

17 recordsLinked to original sources

Finite groups with quadratic splitting fields for all Cayley graphs

For a graph $Γ$, the splitting field of $Γ$ is defined as the splitting field of the characteristic polynomial of $Γ$ over rationals. The algebraic degree of $Γ$ is defined by the extension degree of its splitting field over rationals. Let $k$ be a positive integer. We call a finite group $G$ \textit{Cayley $k$-integral} if, for every inverse-closed subset $S$ of $G$, the algebraic degree of the Cayley graph $\Cay(G,S)$ does not exceed $k$. We give a complete classification of all finite Cayley $2$-integral groups. It is shown that a finite abelian group is Cayley $2$-integral if and only if it is isomorphic to one of the following forms: $G \cong \mathbb{Z}_2^r \times \mathbb{Z}_5^s$, $\mathbb{Z}_2^r \times \mathbb{Z}_4^s \times \mathbb{Z}_8^t$, or $\mathbb{Z}_2^r \times \mathbb{Z}_3^s \times \mathbb{Z}_{12}^t$, where $r, s, t \geq 0$. Furthermore, we prove that the set of finite non-abelian Cayley $2$-integral groups consists of the infinite family $Q_8 \times \mathbb{Z}_2^n$, with $n \geq 0$, and $22$ specific groups.

math.CO↗

Perfect codes and regular sets in vertex-transitive graphs

A subset \( C \) of the vertex set \( V \) of a graph \( Γ= (V,E) \) is termed an $(r,s)$-regular set if each vertex in \( C \) is adjacent to exactly \( r \) other vertices in \( C \), while each vertex not in \( C \) is adjacent to precisely \( s \) vertices in \( C \). A specific case, known as a $(0,1)$-regular set, is referred to as a perfect code. In this paper, we will delve into $(r,s)$-regular sets in the context of vertex-transitive graphs. It is noteworthy that any vertex-transitive graph can be represented as a coset graph \( \Cos(G,H,U) \). When examining a group \( G \) and a subgroup \( H \) of \( G \), a subgroup \( A \) that encompasses \( H \) is identified as an $(r,s)$-regular set related to the pair \( (G,H) \) if there exists a coset graph \( \Cos(G,H,U) \) such that the set of left cosets of \( H \) in \( A \) forms an $(r,s)$-regular set within this graph. In this paper, we present both a necessary and sufficient condition for determining when a normal subgroup \( A \) that includes \( H \) as a normal subgroup qualifies as an $(r,s)$-regular set for the pair \( (G,H) \). Furthermore, if \( A \) is a normal subgroup of \( G \) containing \( H \), we establish a relationship between \( A \) being a perfect code of \( (G,H) \) and the quotient \( N_A(H)/H \) being a perfect code of \(( N_G(H)/H, {1_{N_{G}(H)/H}}) \).

math.CO↗

Finite groups with coprime non-linear codegrees

Given a finite group G with an irreducible character χ\in Irr(G), the codegree of χis defined by cod(χ) = |G :\ker χ|/χ(1). The set of non-linear irreducible character codegrees of G is denoted by cod(G|G'). In this note, we classify all finite groups G with |cod(G|G')|> 1 and for each pair of distinct elements m, n \in cod(G|G'), m and n are coprime.

math.GR↗

Some Properties of normal subgroups determined from character tables

Gcharacter tables of a finite group G were defined before. These tables can be very useful to obtain certain structural information of a normal subgroup from the character table of G. We analyze certain structural properties of normal subgroups which can be determined using their Gcharacter tables. For instance, we prove an extension of the Thompsons theorem from minimal Ginvariant characters of a normal subgroup. We also obtain a variation of Taketas theorem for hypercentral normal subgroups considering their minimal G-invariant characters. This generalization allows us to introduce a new class of nilpotent groups, the class of nMIgroups, whose members verify that its nilpotency class is bounded by the number of irreducible character degrees of the group.

math.GR↗

On the subgroup regular set in Cayley graphs

A subset $C$ of the vertex set of a graph $Γ$ is said to be $(a,b)$-regular if $C$ induces an $a$-regular subgraph and every vertex outside $C$ is adjacent to exactly $b$ vertices in $C$. In particular, if $C$ is an $(a,b)$-regular set of some Cayley graph on a finite group $G$, then $C$ is called an $(a,b)$-regular set of $G$ and a $(0,1)$-regular set is called a perfect code of $G$. In [Wang, Xia and Zhou, Regular sets in Cayley graphs, J. Algebr. Comb., 2022] it is proved that if $H$ is a normal subgroup of $G$, then $H$ is a perfect code of $G$ if and only if it is an $(a,b)$-regular set of $G$, for each $0\leq a\leq|H|-1$ and $0\leq b\leq|H|$ with $\gcd(2,|H|-1)\mid a$. In this paper, we generalize this result and show that a subgroup $H$ of $G$ is a perfect code of $G$ if and only if it is an $(a,b)$-regular set of $G$, for each $0\leq a\leq|H|-1$ and $0\leq b\leq|H|$ such that $\gcd(2,|H|-1)$ divides $a$.

math.CO↗

Characterizing some finite groups by the average order

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) = o(S4). As a consequence of our results we give a characterization for some finite groups by the average order. In [9, Theorem 1.2], the groups whose average orders are less than o(A4) are classified. It is worth mentioning that to get our results we avoid using the main theorems of [9] and our results leads to reprove those theorems.

math.GR↗

Erratum to : A generalization of Taketa's Theorem on M-groups

In the recent paper [A generalization of Taketa's theorem on M-groups, Quaestiones Mathematicae, (2022), https://doi.org/10.2989/16073606.2022.2081632], we give an upper bound 5/2 for the average of non-monomial character degrees of a finite group G, denoted by acdnm(G), which guarantees the solvability of G. Although the result is true, the example we gave to show that the bound is sharp turns out to be incorrect. In this paper, we find a new bound and we give an example to show that this new bound is sharp. Indeed, we prove the solvability of G, by assuming acdnm(G) < acdnm(SL2(5)) = 19/7.

math.GR↗

Variations on average character degrees and solvability

Let $G$ be a finite group, $\Bbb{F}$ be one of the fields $\mathbb{Q},\mathbb{R}$ or $\mathbb{C}$, and $N$ be a non-trivial normal subgroup of $G$. Let ${\rm acd}_{\Bbb{F}}^{*}(G)$ and ${\rm acd}_{\Bbb{F},even}(G|N)$ be the average degree of all non-linear $\Bbb F$-valued irreducible characters of $G$ and of even degree $\Bbb F$-valued irreducible characters of $G$ whose kernels do not contain $N$, respectively. We assume the average of an empty set is $0$ for more convenience. In this paper we prove that if ${\rm acd}^*_{\mathbb{Q}}(G)< 9/2$ or $0<{\rm acd}_{\mathbb{Q},even}(G|N)<4$, then $G$ is solvable. Moreover, setting $\Bbb{F} \in \{\Bbb{R},\Bbb{C}\}$, we obtain the solvability of $G$ by assuming ${\rm acd}_{\Bbb{F}}^{*}(G)<29/8$ or $0<{\rm acd}_{\Bbb{F},even}(G|N)<7/2$, and we conclude the solvability of $N$ when $0<{\rm acd}_{\Bbb{F},even}(G|N)<18/5$. Replacing $N$ by $G$ in ${\rm acd}_{\Bbb{F},even}(G|N)$ gives us an extended form of a result by Moreto and Nguyen. Examples are given to show that all the bounds are sharp.

math.GR↗

On the average character degree of some irreducible characters of a finite group

Let G be a finite group and N be a non-trivial normal subgroup of G, such that the average character degree of irreducible characters in Irr(G|N) is less than or equal to 16=5. Then we prove that N is solvable. Also, we prove the solvability of G, by assuming that the average character degree of irreducible characters in Irr(G|N) is strictly less than 16=5. We show that the bounds are sharp.

math.GR↗

On the multiplicities of the character codegrees

Let G be a finite group and ? be an irreducible character of G, the number cod(?) = jG : Let $ G $ be a finite group and $ χ$ be an irreducible character of $ G $, the number $ \cod(χ) = |G: \kernel(χ)|/χ(1) $ is called the codegree of $ χ$. Also, $ \cod(G) = \{ \cod(χ) \ | \ χ\in \Irr(G) \} $. For $d\in\cod(G)$, the multiplicity of $d$ in $G$, denoted by $m'_G(d)$, is the number of irreducible characters of $G$ having codegree $d$. A finite group $G$ is called a $T'_k$-group for some integer $k\geq 1$, if there exists $d_0\in\cod(G)$ such that $m'_G(d_0)=k$ and for every $d\in\cod(G)-\{d_0\}$, we have $m'_G(d)=1$. In this note we characterize finite $T'_k$-groups completely, where $k\geq 1$ is an integer.

math.GR↗

On Huppert's Rho-Sigma Conjecture

For an irreducible complex character $χ$ of the finite group $G$, let $π(χ)$ denote the set of prime divisors of the degree $χ(1)$ of $χ$. Denote then by $ρ(G)$ the union of all the sets $π(χ)$ and by $σ(G)$ the largest value of $|π(χ)|$, as $χ$ runs in ${\rm{Irr}}(G)$. The $ρ$-$σ$ conjecture, formulated by Bertram Huppert in the 80's, predicts that $|ρ(G)|\leq 3σ(G)$ always holds, whereas $|ρ(G)|\leq 2σ(G)$ holds if $G$ is solvable; moreover, O. Manz and T.R. Wolf proposed a "strengthened" form of the conjecture in the general case, asking whether $|ρ(G)|\leq 2σ(G)+1$ is true for every finite group $G$. In this paper we study the strengthened $ρ$-$σ$ conjecture for the class of finite groups having a trivial Fitting subgroup: in this context, we prove that the conjecture is true provided $σ(G)\leq 5$, but it is false in general if $σ(G)\geq 6$. Instead, we establish that $|ρ(G)|\leq 3σ(G)-4$ holds for every finite group with a trivial Fitting subgroup and with $σ(G)\geq 6$ (this being the right, best possible bound). Also, we improve the up-to-date best bound for the solvable case, showing that we have $|ρ(G)|\leq 3σ(G)$ whenever $G$ belongs to one particular class including all the finite solvable groups.

math.GR↗

Equivalent version of Huppert's conjecture on the codegrees

Let G be a finite group, Irr(G) the set of all irreducible complex characters of G and X \in Irr(G). Let also cod(X) = |G : kerX|/X(1) and cod(G) = {cod(X) | X \in Irr(G)}. In this note, we show that the simple group PSL(2, q), for a prime power q > 3, is uniquely determined by the set of its codegree.

math.GR↗

Minimal partition-free groups

Let G be a finite group. A collection P={H1, ..., Hr} of subgroups of G, where r > 1, is said a non-trivial partition of G if every non-identity element of G belongs to one and only one Hi, for some 1 <=i<=r. We call a group G that does not admit any non-trivial partition a partition-free group. In this paper, we study a partition-free group G whose all proper non-cyclic subgroups admit non-trivial partitions.

math.GR↗

A result on the sum of element orders of a finite group

Let $G$ be a finite group and $ψ(G)=\sum_{g\in{G}}{o(g)}$. There are some results about the relation between $ψ(G)$ and the structure of $G$. For instance, it is proved that if $G$ is a group of order $n$ and $ψ(G)>\dfrac{211}{1617}ψ(C_n)$, then $G$ is solvable. Herzog {\it{et al.}} in [Herzog {\it{et al.}}, Two new criteria for solvability of finite groups, J. Algebra, 2018] put forward the following conjecture: \noindent{\bf Conjecture.} {\it {If $G$ is a non-solvable group of order $n$, then $${ψ(G)}\,{\leq}\,{{\dfrac{211}{1617}}{ψ(C_n)}}$$ with equality if and only if $G=A_5$. In particular, this inequality holds for all non-abelian simple groups.} } In this paper, we prove a modified version of Herzog's Conjecture.

math.GR↗

Bounding the number of vertices in the degree graph of a finite group

Let $G$ be a finite group, and let ${\rm{cd}}(G)$ denote the set of degrees of the irreducible complex characters of $G$. The degree graph $Δ(G)$ of $G$ is defined as the simple undirected graph whose vertex set ${\rm{V}}(G)$ consists of the prime divisors of the numbers in ${\rm{cd}}(G)$, two distinct vertices $p$ and $q$ being adjacent if and only if $pq$ divides some number in ${\rm{cd}}(G)$. In this note, we provide an upper bound on the size of ${\rm{V}}(G)$ in terms of the clique number $ω(G)$ (i.e., the maximum size of a subset of ${\rm{V}}(G)$ inducing a complete subgraph) of $Δ(G)$. Namely, we show that $|{\rm{V}}(G)|\leq{\rm{max}}\{2ω(G)+1,\;3ω(G)-4\}$. Examples are given in order to show that the bound is best possible. This completes the analysis carried out in [1] where the solvable case was treated, extends the results in [3,4,9], and answers a question posed by the first author and H.P. Tong-Viet in [4].

math.GR↗

On the character degree graph of finite groups

Given a finite group G, let cd(G) denote the set of degrees of the irreducible complex characters of G. The character degree graph of G is defined as the simple undirected graph whose vertices are the prime divisors of the numbers in cd(G), two distinct vertices p and q being adjacent if and only if pq divides some number in cd(G). In this paper, we consider the complement of the character degree graph, and we characterize the finite groups for which this complement graph is not bipartite. This extends the analysis of [1], where the solvable case was treated.

math.GR↗

On the character degree graph of solvable groups

Let \(G\) be a finite solvable group, and let \(Δ(G)\) denote the \emph{prime graph} built on the set of degrees of the irreducible complex characters of \(G\). A fundamental result by P.P. Pálfy asserts that the complement $\barΔ(G)$ of the graph \(Δ(G)\) does not contain any cycle of length \(3\). In this paper we generalize Pálfy's result, showing that $\barΔ(G)$ does not contain any cycle of odd length, whence it is a bipartite graph. As an immediate consequence, the set of vertices of \(Δ(G)\) can be covered by two subsets, each inducing a complete subgraph. The latter property yields in turn that if \(n\) is the clique number of \(Δ(G)\), then \(Δ(G)\) has at most \(2n\) vertices. This confirms a conjecture by Z. Akhlaghi and H.P. Tong-Viet, and provides some evidence for the famous \emph{\(ρ\)-\(σ\) conjecture} by B. Huppert.

math.GR↗