scholarly journals On recognition by prime graph of the projective special linear group over GF(3)

2014 ◽  
Vol 95 (109) ◽  
pp. 255-266
Author(s):  
Bahman Khosravi ◽  
Behnam Khosravi ◽  
Oskouei Dalili
Keyword(s):  
Finite Group ◽  
Simple Group ◽  
Linear Group ◽  
Prime Graph ◽  
Special Linear Group ◽  
Composition Factor ◽  
Projective Special Linear Group ◽  
Special Linear ◽  
A Finite Group ◽  
Nonabelian Composition Factor

Let G be a finite group. The prime graph of G is denoted by ?(G). We prove that the simple group PSLn(3), where n ? 9, is quasirecognizable by prime graph; i.e., if G is a finite group such that ?(G) = ?(PSLn(3)), then G has a unique nonabelian composition factor isomorphic to PSLn(3). Darafsheh proved in 2010 that if p > 3 is a prime number, then the projective special linear group PSLp(3) is at most 2-recognizable by spectrum. As a consequence of our result we prove that if n ? 9, then PSLn(3) is at most 2-recognizable by spectrum.

Centralizers in a group whose central factor is simple

2018 ◽  
Vol 17 (08) ◽  
pp. 1850149
Author(s):  
Seyyed Majid Jafarian Amiri ◽  
Hojjat Rostami
Keyword(s):  
Finite Group ◽  
Linear Group ◽  
Finite Groups ◽  
Special Linear Group ◽  
Projective Special Linear Group ◽  
Special Linear ◽  
Central Factor ◽  
Suzuki Group ◽  
A Finite Group ◽  
Appl Math

In this paper, we find the number of the element centralizers of a finite group [Formula: see text] such that the central factor of [Formula: see text] is the projective special linear group of degree 2 or the Suzuki group. Our results generalize some main results of [Ashrafi and Taeri, On finite groups with a certain number of centralizers, J. Appl. Math. Comput. 17 (2005) 217–227; Schmidt, Zentralisatorverbände endlicher Gruppen, Rend. Sem. Mat. Univ. Padova 44 (1970) 97–131; Zarrin, On element centralizers in finite groups, Arch. Math. 93 (2009) 497–503]. Also, we give an application of these results.

CHARACTERIZATION BY PRIME GRAPH OF PGL(2, pk) WHERE p AND k > 1 ARE ODD

2010 ◽  
Vol 20 (07) ◽  
pp. 847-873 ◽  
Author(s):  
Z. AKHLAGHI ◽  
B. KHOSRAVI ◽  
M. KHATAMI
Keyword(s):  
Finite Group ◽  
Group Theory ◽  
Prime Number ◽  
Prime Graph ◽  
Composition Factor ◽  
Simple Groups ◽  
Almost Simple Groups ◽  
Prime Graphs ◽  
A Finite Group ◽  
Nonabelian Composition Factor

Let G be a finite group. The prime graph Γ(G) of G is defined as follows. The vertices of Γ(G) are the primes dividing the order of G and two distinct vertices p, p′ are joined by an edge if there is an element in G of order pp′. In [G. Y. Chen et al., Recognition of the finite almost simple groups PGL2(q) by their spectrum, Journal of Group Theory, 10 (2007) 71–85], it is proved that PGL(2, pk), where p is an odd prime and k > 1 is an integer, is recognizable by its spectrum. It is proved that if p > 19 is a prime number which is not a Mersenne or Fermat prime and Γ(G) = Γ(PGL(2, p)), then G has a unique nonabelian composition factor which is isomorphic to PSL(2, p). In this paper as the main result, we show that if p is an odd prime and k > 1 is an odd integer, then PGL(2, pk) is uniquely determined by its prime graph and so these groups are characterizable by their prime graphs.

Quasirecognition of E6(q) by the orders of maximal abelian subgroups

2018 ◽  
Vol 17 (07) ◽  
pp. 1850122 ◽  
Author(s):  
Zahra Momen ◽  
Behrooz Khosravi
Keyword(s):  
Finite Group ◽  
Automorphism Group ◽  
Simple Group ◽  
Outer Automorphism ◽  
Composition Factor ◽  
Outer Automorphism Group ◽  
Abelian Subgroups ◽  
A Finite Group ◽  
Nonabelian Composition Factor

In [Li and Chen, A new characterization of the simple group [Formula: see text], Sib. Math. J. 53(2) (2012) 213–247.], it is proved that the simple group [Formula: see text] is uniquely determined by the set of orders of its maximal abelian subgroups. Also in [Momen and Khosravi, Groups with the same orders of maximal abelian subgroups as [Formula: see text], Monatsh. Math. 174 (2013) 285–303], the authors proved that if [Formula: see text], where [Formula: see text] is not a Mersenne prime, then every finite group with the same orders of maximal abelian subgroups as [Formula: see text], is isomorphic to [Formula: see text] or an extension of [Formula: see text] by a subgroup of the outer automorphism group of [Formula: see text]. In this paper, we prove that if [Formula: see text] is a finite group with the same orders of maximal abelian subgroups as [Formula: see text], then [Formula: see text] has a unique nonabelian composition factor which is isomorphic to [Formula: see text].

scholarly journals Quasirecognition by Prime Graph of the Groups 2D2n(q) Where q < 105

2017 ◽  
Author(s):  
Hossein Moradi ◽  
Mohammad Reza Darafsheh ◽  
Ali Iranmanesh
Keyword(s):  
Finite Group ◽  
Simple Group ◽  
Prime Power ◽  
Prime Graph ◽  
Composition Factor ◽  
Simple Groups ◽  
Finite Simple Groups ◽  
Prime Divisors ◽  
A Finite Group

Let G be a finite group. The prime graph &Gamma;(G) of G is defined as follows: The set of vertices of&nbsp;&Gamma;(G) is the set of prime divisors of |G| and two distinct vertices p and p' are connected in &Gamma;(G), whenever G has an element of order pp'. A non-abelian simple group P is called recognizable by prime graph if for any finite group G with &Gamma;(G)=&Gamma;(P), G has a composition factor isomorphic to P. In&nbsp;[4] proved finite simple groups 2Dn(q), where&nbsp;n&nbsp;&ne; 4k are quasirecognizable by prime graph. Now in this paper we discuss the quasirecognizability by prime graph of the simple groups 2D2k(q), where&nbsp;k &ge; 9 and q is a prime power less than 105.

QUASIRECOGNITION BY PRIME GRAPH OF SOME ORTHOGONAL GROUPS OVER THE BINARY FIELD

2012 ◽  
Vol 11 (03) ◽  
pp. 1250056 ◽  
Author(s):  
BEHROOZ KHOSRAVI ◽  
HOSSEIN MORADI
Keyword(s):  
Finite Group ◽  
Prime Number ◽  
Prime Graph ◽  
Composition Factor ◽  
Orthogonal Groups ◽  
Binary Field ◽  
A Finite Group ◽  
Nonabelian Composition Factor

Let G be a finite group. The prime graph Γ(G) of G is defined as follows. The vertices of Γ(G) are the primes dividing the order of G and two distinct vertices p, p′ are joined by an edge if G has an element of order pp′. Let D = Dn(2), where n ≥ 3 or 2Dn(2), where n ≥ 15. In this paper we prove that D is quasirecognizable by prime graph, i.e. every finite group G with Γ(G) = Γ(D), has a unique nonabelian composition factor which is isomorphic to D. Finally, we consider the quasirecognition by spectrum for these groups. Specially we prove that if p = 2n + 1 ≥ 17 is a prime number, then Dp(2) is recognizable by spectrum.

n-RECOGNITION BY PRIME GRAPH OF THE SIMPLE GROUP PSL(2,q)

2008 ◽  
Vol 07 (06) ◽  
pp. 735-748 ◽  
Author(s):  
BEHROOZ KHOSRAVI
Keyword(s):  
Finite Group ◽  
Simple Group ◽  
Prime Number ◽  
Finite Groups ◽  
Prime Graph ◽  
Split Extension ◽  
A Finite Group

Let G be a finite group. The prime graph Γ(G) of G is defined as follows. The vertices of Γ(G) are the primes dividing the order of G and two distinct vertices p, q are joined by an edge if there is an element in G of order pq. It is proved that if p > 11 and p ≢ 1 (mod 12), then PSL(2,p) is uniquely determined by its prime graph. Also it is proved that if p > 7 is a prime number and Γ(G) = Γ(PSL(2,p2)), then G ≅ PSL(2,p2) or G ≅ PSL(2,p2).2, the non-split extension of PSL(2,p2) by ℤ2. In this paper as the main result we determine finite groups G such that Γ(G) = Γ(PSL(2,q)), where q = pk. As a consequence of our results we prove that if q = pk, k > 1 is odd and p is an odd prime number, then PSL(2,q) is uniquely determined by its prime graph and so these groups are characterizable by their prime graph.

scholarly journals Cyclotomic equations and square properties in rings

1986 ◽  
Vol 9 (1) ◽  
pp. 89-95
Author(s):  
Benjamin Fine
Keyword(s):  
Linear Group ◽  
Special Linear Group ◽  
Sum Of Squares ◽  
Polynomial Rings ◽  
Projective Special Linear Group ◽  
Infinite Class ◽  
Related Property ◽  
Special Linear

IfRis a ring, the structure of the projective special linear groupPSL2(R)is used to investigate the existence of sum of square properties holding inR. Rings which satisfy Fermat's two-square theorem are called sum of squares rings and have been studied previously. The present study considers a related property called square property one. It is shown that this holds in an infinite class of rings which includes the integers, polynomial rings over many fields andZpnwherePis a prime such that−3is not a squaremodp. Finally, it is shown that the class of sum of squares rings and the class satisfying square property one are non-coincidental.

Sign in / Sign up

Export Citation Format

Share Document