On the genus of the groups PSL(2, q), PSL(3, q), and PSp(4, q)

SL(n, q) is the group of n×n matrices, over the Galois field GF(q), of determinate 1. PSL(n, q) is SL(n, q) modulo the scalar n×n matrices of determinate 1. PSL(n, q) acts on the Desarguesian projective space PG(n−1, q). Sp(4, q) is the group of 4 × 4 matrices of determinate 1 which preserve the symplectic bilinear form on the 4 × 1 matrices over GF(q). PSp(4, q) is Sp(4, q) modulo Z = {1,−1}. PSp(4, q) acts on the symplectic generalized quadrangle W(3, q), a subspace of the projective space PG(3, q), as a group of automorphisms. In this paper, bounds are given for the genus of these groups.     

Generalized quadrangles admitting PSL(2,q) × PSL(2,q)

In this paper, we classify the generalized quadrangles of order (s,t), s ≠ 1 ≠ t, which admit the natural action of PSL(2,s) × PSL(2,s) on a subGQ of order (s,1). This generalizes a recent result of J. De Kaey and H. Van Maldeghem 3 , by whom the classification was obtained for the case s = t. © 2005 Wiley Periodicals, Inc. J Combin Designs.     

Halving PSL(2,q)

We show that PSL(2,q), q 3(mod 4), contains a subset of half the cardinality of PSL(2,q), which is uniformly 2-homogeneous on the projective line.     

Verifying Huppert's Conjecture for PSL3(q) and PSU3(q 2)

Let G be a finite group and cd(G) be the set of irreducible character degrees of G. Bertram Huppert conjectured that if H is a finite nonabelian simple group such that cd(G) = cd(H), then G ? H × A, where A is an abelian group. We examine arguments to verify this conjecture for the simple groups of Lie type of rank two. To illustrate our arguments, we extend Huppert's results and verify the conjecture for the simple linear and unitary groups of rank two.     

3‐Spontaneous Emission Error Designs from PSL(2, q) or PGL(2, q)

Quantum jump codes are quantum codes that correct errors caused by quantum jumps. A spontaneous emission error design (SEED) was introduced by Beth et al. in 2003 to construct quantum jump codes. In this paper, we study the existence of 3‐SEEDs from PSL(2, q) or PGL(2, q). By doing this, a large number of 3‐ SEEDs are derived for prime powers q and all .     

Coprime commutators in PSL(2, q)

We show that every element of PSL(2, q) is a commutator of elements of coprime orders. This is proved by showing first that in PSL(2, q) any two involutions are conjugate by an element of odd order.     

2-(v,k,1)设计和PSL(3,q)(q是奇数)

§ 1　 IntroductionA2 -(v,k,1 ) design D=(S,B) consists ofa finite set Sof v points and a collection Bof some subsets of S,called blocks,such that any two points lie on exactly one blockand each block contains exactly k points.A flag of Dis a pair(α,B) such thatα∈S,B∈Bandα∈B,the set of all flags is denoted by F.We assume that2≤k≤v.An automorphism of Dis a permutation of the points which leaves the set Binvari-ant,all the automorphisms form a group Aut D.Let G be a subgroup of A…     

Flag-Transitive 3-(v,k, 3) Designs and PSL(2, q) Groups

This article is a contribution to the study of the automorphism groups of 3-(v,k,3) designs.Let S =(P,B) be a non-trivial 3-(q+ 1,k,3) design.If a two-dimensional projective linear group PSL(2,q) acts flag-transitively on S,then S is a 3-(q + 1,4,3) or 3-(q + 1,5,3) design.     

A New Characterization of PSL(p,q)

Abstract

Order components of a finite group are introduced in Chen [Chen, G. Y. (1996c) On Thompson's conjecture. J. Algebra 185:184–193]. It was proved that PSL(3, q), where q is an odd prime power, is uniquely determined by its order components [Iranmanesh, A., Alavi, S. H., Khosravi, B. (2002a). A characterization of PSL(3, q) where q is an odd prime power. J. Pure Appl. Algebra 170(2–3): 243–254]. Also in Iranmanesh et al. [Iranmanesh, A., Alavi, S. H., Khosravi, B. (2002b). A characterization of PSL(3, q) where q = 2 ⁿ . Acta Math. Sinica, English Ser. 18(3):463–472] and [Iranmanesh, A., Alavi, S. H. (2002). A characterization of simple groups PSL(5, q). Bull. Austral. Math. Soc. 65:211–222] it was proved that PSL(3, q) for q = 2 ⁿ and PSL(5, q) are uniquely determined by their order components. In this paper we prove that PSL(p, q) can be uniquely determined by its order components, where p is an odd prime number. A main consequence of our results is the validity of Thompson's conjecture for the groups under consideration.     

Writing Elements of PSL(2, q) as Commutators

We prove that for q ≥ 13, an element A of SL(2, q) is the commutator of a generating pair if and only if A ≠ ?I and the trace of A is not 2. Consequently, when q is odd and q ≥ 13, every nontrivial element of PSL(2, q) is the commutator of a generating pair, and when q is even, an element of PSL(2, q) is the commutator of a generating pair if and only if its trace is not 0. The proof of these results also leads to an improved lower bound on the number of T-systems of generating pairs of PSL(2, q).     

A RECOGNITION OF SIMPLE GROUPS PSL（3, q） BY THEIR ELEMENT ORDERS

For any group G, denote byπe(G) the set of orders of elements in G. Given a finite group G, let h(πe (G)) be the number of isomorphism classes of finite groups with the same set πe(G) of element orders. A group G is called k-recognizable if h(πe(G)) = k <∞, otherwise G is called non-recognizable. Also a 1-recognizable group is called a recognizable (or characterizable) group. In this paper the authors show that the simple groups PSL(3,q), where 3 < q≡±2 (mod 5) and (6, (q-1)/2) = 1, are recognizable.     

A proof by graphs that PSL(2, 7) PSL(3, 2)

We give three definitions of the Coxeter graph. By the second one we see that PSL(2, 7) is contained in the automorphism group of that graph as a subgroup of index 2, and by the third one that the same holds for PSL(3, 2).