scholarly journals A new characterization of the automorphism groups of Mathieu groups

2021 ◽  
Vol 19 (1) ◽  
pp. 1245-1250
Author(s):  
Xin Liu ◽  
Guiyun Chen ◽  
Yanxiong Yan

Abstract Let cd ( G ) {\rm{cd}}\left(G) be the set of irreducible complex character degrees of a finite group G G . ρ ( G ) \rho \left(G) denotes the set of primes dividing degrees in cd ( G ) {\rm{cd}}\left(G) . For any prime p, let p e p ( G ) = max { χ ( 1 ) p ∣ χ ∈ Irr ( G ) } {p}^{{e}_{p}\left(G)}=\max \left\{\chi {\left(1)}_{p}\hspace{0.08em}| \hspace{0.08em}\chi \in {\rm{Irr}}\left(G)\right\} and V ( G ) = { p e p ( G ) ∣ p ∈ ρ ( G ) } V\left(G)=\left\{{p}^{{e}_{p}\left(G)}\hspace{0.08em}| \hspace{0.1em}p\in \rho \left(G)\right\} . The degree prime-power graph Γ ( G ) \Gamma \left(G) of G G is a graph whose vertices set is V ( G ) V\left(G) , and two vertices x , y ∈ V ( G ) x,y\in V\left(G) are joined by an edge if and only if there exists m ∈ cd ( G ) m\in {\rm{cd}}\left(G) such that x y ∣ m xy| m . It is an interesting and difficult problem to determine the structure of a finite group by using its degree prime-power graphs. Qin proved that all Mathieu groups can be uniquely determined by their orders and degree prime-power graphs. In this article, we continue this topic and successfully characterize all the automorphism groups of Mathieu groups by using their orders and degree prime-power graphs.

2016 ◽  
Vol 99 (113) ◽  
pp. 257-264 ◽  
Author(s):  
Somayeh Heydari ◽  
Neda Ahanjideh

For a finite group G, let cd(G) be the set of irreducible complex character degrees of G forgetting multiplicities and X1(G) be the set of all irreducible complex character degrees of G counting multiplicities. Suppose that p is a prime number. We prove that if G is a finite group such that |G| = |PGL(2,p) |, p ? cd(G) and max(cd(G)) = p+1, then G ? PGL(2,p), SL(2, p) or PSL(2,p) x A, where A is a cyclic group of order (2, p-1). Also, we show that if G is a finite group with X1(G) = X1(PGL(2,pn)), then G ? PGL(2, pn). In particular, this implies that PGL(2, pn) is uniquely determined by the structure of its complex group algebra.


2019 ◽  
Vol 26 (03) ◽  
pp. 459-466
Author(s):  
Changguo Shao ◽  
Qinhui Jiang

An element g in a finite group G is called a vanishing element if there exists some irreducible complex character χ of G such that [Formula: see text]. Denote by Vo(G) the set of orders of vanishing elements of G, and we prove that [Formula: see text] if and only if [Formula: see text] and [Formula: see text], where [Formula: see text] is a prime power.


2019 ◽  
Vol 19 (04) ◽  
pp. 2050062 ◽  
Author(s):  
Samir Zahirović ◽  
Ivica Bošnjak ◽  
Rozália Madarász

The enhanced power graph [Formula: see text] of a group [Formula: see text] is the graph with vertex set [Formula: see text] such that two vertices [Formula: see text] and [Formula: see text] are adjacent if they are contained in the same cyclic subgroup. We prove that finite groups with isomorphic enhanced power graphs have isomorphic directed power graphs. We show that any isomorphism between undirected power graph of finite groups is an isomorphism between enhanced power graphs of these groups, and we find all finite groups [Formula: see text] for which [Formula: see text] is abelian, all finite groups [Formula: see text] with [Formula: see text] being prime power, and all finite groups [Formula: see text] with [Formula: see text] being square-free. Also, we describe enhanced power graphs of finite abelian groups. Finally, we give a characterization of finite nilpotent groups whose enhanced power graphs are perfect, and we present a sufficient condition for a finite group to have weakly perfect enhanced power graph.


2017 ◽  
Vol 16 (11) ◽  
pp. 1750216 ◽  
Author(s):  
Jinshan Zhang ◽  
Changguo Shao ◽  
Zhencai Shen

Let [Formula: see text] be a finite group. A vanishing element of [Formula: see text] is an element [Formula: see text] such that [Formula: see text] for some irreducible complex character [Formula: see text] of [Formula: see text]. Denote by Vo[Formula: see text] the set of the orders of vanishing elements of [Formula: see text]. In this paper, we prove that if [Formula: see text] is a finite group such that Vo[Formula: see text], [Formula: see text], then [Formula: see text].


Author(s):  
Mahdi Ebrahimi ◽  
Maryam khatami ◽  
Zohreh Mirzaei

For a finite group [Formula: see text], let [Formula: see text] be the character-graph which is built on the set of irreducible complex character degrees of [Formula: see text]. In this paper, we wish to determine the structure of finite groups [Formula: see text] such that [Formula: see text] is 1-connected with nonbipartite complement. Also, we classify all 1-connected graphs with nonbipartite complement that can occur as the character-graph [Formula: see text] of a finite group [Formula: see text].


2013 ◽  
Vol 13 (02) ◽  
pp. 1350100 ◽  
Author(s):  
GUOHUA QIAN ◽  
YANMING WANG

Let p be a fixed prime, G a finite group and P a Sylow p-subgroup of G. The main results of this paper are as follows: (1) If gcd (p-1, |G|) = 1 and p2 does not divide |xG| for any p′-element x of prime power order, then G is a solvable p-nilpotent group and a Sylow p-subgroup of G/Op(G) is elementary abelian. (2) Suppose that G is p-solvable. If pp-1 does not divide |xG| for any element x of prime power order, then the p-length of G is at most one. (3) Suppose that G is p-solvable. If pp-1 does not divide χ(1) for any χ ∈ Irr (G), then both the p-length and p′-length of G are at most 2.


2012 ◽  
Vol 11 (06) ◽  
pp. 1250108 ◽  
Author(s):  
HUNG NGOC NGUYEN ◽  
HUNG P. TONG-VIET ◽  
THOMAS P. WAKEFIELD

Let G be a finite group and let cd (G) be the set of all irreducible complex character degrees of G. It was conjectured by Huppert in Illinois J. Math.44 (2000) that, for every non-abelian finite simple group H, if cd (G) = cd (H) then G ≅ H × A for some abelian group A. In this paper, we confirm the conjecture for the family of projective special linear groups PSL 4(q) with q ≥ 13.


2016 ◽  
Vol 15 (09) ◽  
pp. 1650164 ◽  
Author(s):  
Farideh Shafiei ◽  
Ali Iranmanesh

Let [Formula: see text] be a finite group and the irreducible character degree set of [Formula: see text] is contained in [Formula: see text], where [Formula: see text], and [Formula: see text] are distinct integers. We show that one of the following statements holds: [Formula: see text] is solvable; [Formula: see text]; or [Formula: see text] for some prime power [Formula: see text].


2012 ◽  
Vol 31 (1) ◽  
pp. 213
Author(s):  
Alireza Khalili Asboei ◽  
Syyed Sadegh Salehi Amiri ◽  
Ali Iranmanesh ◽  
Abolfazl Tehranian

Let G be a finite group with trivial center and n_{p}(G) be the number of Sylow p- subgroup of G. In this paper we prove that if n_{p}(G)=n_{p}(M_{n}), for every prime p in pi (G), where n in {11, 12}, then M_{n}<= G <= Aut(M_{n}).


Sign in / Sign up

Export Citation Format

Share Document