OD-Characterization of Some Projective Special Linear Groups Over the Binary Field and Their Automorphism Groups

The Gruenberg–Kegel graph GK(G) = (V _G , E _G ) of a finite group G is a simple graph with vertex set V _G  = π(G), the set of all primes dividing the order of G, and such that two distinct vertices p and q are joined by an edge, {p, q} ∈ E _G , if G contains an element of order pq. The degree deg _G (p) of a vertex p ∈ V _G is the number of edges incident to p. In the case when π(G) = {p ₁, p ₂,…, p _h } with p ₁ < p ₂ < … <p _h , we consider the h-tuple D(G) = (deg _G (p ₁), deg _G (p ₂),…, deg _G (p _h )), which is called the degree pattern of G. The group G is called k-fold OD-characterizable if there exist exactly k non-isomorphic groups H satisfying condition (|H|, D(H)) = (|G|, D(G)). Especially, a 1-fold OD-characterizable group is simply called OD-characterizable. In this paper, we prove that the simple groups L ₁₀(2) and L ₁₁(2) are OD-characterizable. It is also shown that automorphism groups Aut(L _p (2)) and Aut(L _p+1(2)), where 2 ^p  ? 1 is a Mersenne prime, are OD-characterizable. Finally, a list of finite (simple) groups which are presently known to be k-fold OD-characterizable, for certain values of k, is presented.     

On Finite Groups with Few Automorphism Orbits

Denote by ω(G) the number of orbits of the action of Aut(G) on the finite group G. We prove that if G is a finite nonsolvable group in which ω(G) ≤5, then G is isomorphic to one of the groups A₅, A₆, PSL(2, 7), or PSL(2, 8). We also consider the case when ω(G) = 6 and show that, if G is a nonsolvable finite group with ω(G) = 6, then either G ≈ PSL(3, 4) or there exists a characteristic elementary abelian 2-subgroup N of G such that G/N ≈ A₅.     

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.     

The Orders of Vertices of a Character-degree Graph

Let G be a finite group. We put ρ(G) = {p|p is a prime dividing χ(1) for some χ ∈Irr(G)}. We define a graph Γ(G), whose vertices are the primes in ρ(G) and p, q ∈ ρ(G) are connected in Γ(G) denoted p ～ q, if pq||χ(1) for some χ ∈Irr(G). For p ∈ ρ(G), we define ord(p) = |{q ∈ ρ(G)|q ～ p}|. We call ord(p) the order of the vertex p of the graph Γ(G). In this article, we discuss orders and the influences of orders on the structure of finite groups.     

The Relative Brauer Group of an Affine Double Plane

We study algebra classes and divisor classes on a normal affine surface of the form z ² = f(x, y). The affine coordinate ring is T = k[x, y, z]/(z ² ? f), and if R = k[x, y][f ^?1] and S = R[z]/(z ² ? f), then S is a quadratic Galois extension of R. If the Galois group is G, we show that the natural map H¹(G, Cl(T)) → H¹(G, Pic(S)) factors through the relative Brauer group B(S/R) and that all of the maps are onto. Sufficient conditions are given for H¹(G, Cl(T)) to be isomorphic to B(S/R). The groups and maps are computed for several examples.     

Weak Cayley Table Groups II: Alternating Groups and Finite Coxeter Groups

A weak Cayley table isomorphism is a bijection φ: G → H of groups such that φ(xy) ～ φ(x)φ(y) for all x, y ∈ G. Here ～denotes conjugacy. When G = H the set of all weak Cayley table isomorphisms φ: G → G forms a group 𝒲(G) that contains the automorphism group Aut(G) and the inverse map I: G → G, x → x ^?1. Let 𝒲₀(G) = ?Aut(G), I? ≤ 𝒲(G) and say that G has trivial weak Cayley table group if 𝒲(G) = 𝒲₀(G). We show that all finite irreducible Coxeter groups (except possibly E ₈) have trivial weak Cayley table group, as well as most alternating groups. We also consider some sporadic simple groups.     

The Second Cohomology of Simple SL 3-Modules

Let G be the simple, simply connected algebraic group SL ₃ defined over an algebraically closed field K of characteristic p > 0. In this article, we find H ²(G, V) for any irreducible G-module V. When p > 7, we also find H ²(G(q), V) for any irreducible G(q)-module V for the finite Chevalley groups G(q) = SL(3, q) where q is a power of p.     

Weak Cayley table groups III: PSL(2,q)

A weak Cayley table isomorphism is a bijection φ:G→H of groups such that φ(xy)～φ(x)φ(y) for all x,y∈G. Here ～ denotes conjugacy. When G = H the set of all weak Cayley table isomorphisms φ:G→G forms a group 𝒲(G) that contains the automorphism group Aut(G) and the inverse map I:G→G,x?x^?1. Let 𝒲₀(G) = ?Aut(G),I?≤𝒲(G) and say that G has trivial weak Cayley table group if 𝒲(G) = 𝒲₀(G). We show that PSL(2,pⁿ) has trivial weak Cayley table group, where p≥5 is a prime and n≥1.     

Psl(2,q) quotients of some hyperbolic tetrahedral and coxeter groups

We classify quotients of type PSL(2,q) and PGL(2,q) with torsion-free kernel for four of the nine hyperbolic tetrahedral groups. Using this result, we give a classification of the quotients with torsion-free kernel of type PSL(2q) ×Z₂ of the associated Coxeter or reflection groups. These do not admit quotients of type PSL(2,q),PGL(2,q). We also study quotients of type PSL(2,q) and PGL(2,q) of the fundamental group of the hyperbolic 3-orbifold of minimal known volume.     

Nilpotent Length of a Finite Solvable Group with a Frobenius Group of Automorphisms

We prove that a finite solvable group G admitting a Frobenius group FH of automorphisms of coprime order with kernel F and complement H such that [G, F] = G and C _{C G (F)}(h) = 1 for all nonidentity elements h ∈ H, is of nilpotent length equal to the nilpotent length of the subgroup of fixed points of H.     

OD-Characterization of alternating and symmetric groups of degrees 16 and 22

Let G be a finite group and π(G) be the set of all prime divisors of its order. The prime graph GK(G) of G is a simple graph with vertex set π(G), and two distinct primes p, q ∈ π(G) are adjacent by an edge if and only if G has an element of order pq. For a vertex p ∈ π(G), the degree of p is denoted by deg(p) and as usual is the number of distinct vertices joined to p. If π(G) = {p ₁, p ₂,...,p _k }, where p ₁ < p ₂ < ... < p _k , then the degree pattern of G is defined by D(G) = (deg(p ₁), deg(p ₂),...,deg(p _k )). The group G is called k-fold OD-characterizable if there exist exactly k non-isomorphic groups H satisfying conditions |H| = |G| and D(H) = D(G). In addition, a 1-fold OD-characterizable group is simply called OD-characterizable. In the present article, we show that the alternating group A ₂₂ is OD-characterizable. We also show that the automorphism groups of the alternating groups A ₁₆ and A ₂₂, i.e., the symmetric groups S ₁₆ and S ₂₂ are 3-fold OD-characterizable. It is worth mentioning that the prime graph associated to all these groups are connected.     

The Multiplicity Free Permutation Representations of the Ree Groups 2 G 2(q), the Suzuki Groups 2 B 2(q), and Their Automorphism Groups

Abstract

Let G a simple group of type ² B ₂(q) or ² G ₂(q), where q is an odd power of 2 or 3, respectively. The main goal of this paper is to determine the multiplicity free permutation representations of G and A ≤ Aut(G) where A is a subgroup containing a copy of G. Let B be a Borel subgroup of G. If G = ² B ₂(q) we show that there is only one non-trivial multiplicity free permutation representation, namely the representation of G associated to the action on G/B. If G = ² G ₂(q) we show that there are exactly two such non-trivial representations, namely the representations of G associated to the action on G/B and the action on G/M, where M = UC with U the maximal unipotent subgroup of B and C the unique subgroup of index 2 in the maximal split torus of B. The multiplicity free permutation representations of A correspond to the actions on A/H where H is isomorphic to a subgroup containing B if G = ² B ₂(q), and containing M if G = ² G ₂(q). The problem of determining the multiplicity free representations of the finite simple groups is important, for example, in the classification of distance-transitive graphs.     

Hall parameters of complete and complete bipartite graphs

Given a graph G, for each υ ∈V(G) let L(υ) be a list assignment to G. The well‐known choice number c(G) is the least integer j such that if |L(υ)| ≥j for all υ ∈V(G), then G has a proper vertex colouring ? with ?(υ) ∈ L (υ) (?υ ∈V(G)). The Hall number h(G) is like the choice number, except that an extra non‐triviality condition, called Hall's condition, has to be satisfied by the list assignment. The edge‐analogue of the Hall number is called the Hall index, h′(G), and the total analogue is called the total Hall number, h″(G), of G. If the stock of colours from which L(υ) is selected is restricted to a set of size k, then the analogous numbers are called k‐restricted, or restricted, Hall parameters, and are denoted by h_k(G), h′_k(G) and h″_k(G). Our main object in this article is to determine, or closely bound, h′(K), h″(K_n), h′(K_m,n) and h′_k(K_m,n). We also answer some hitherto unresolved questions about Hall parameters. We show in particular that there are examples of graphs G with h′(G)?h′(G ? e)>1. We show that there are examples of graphs G and induced subgraphs H with h_k(G)<h_k(H) [this phenomenon cannot occur with unrestricted Hall numbers]. We also give an example of a graph G and an integer k such that h_k(G)<χ(G)<h(G). © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 208–237, 2002     

Finite Groups with Conjugacy Classes Number One Greater than Its Same Order Classes Number

ABSTRACT

Let k(G) be the number of conjugacy classes of finite groups G and π _e (G) be the set of the orders of elements in G. Then there exists a non-negative integer k such that k(G) = |π _e (G)| + k. We call such groups to be co(k) groups. This article classifies all finite co(1) groups. They are isomorphic to one of the following groups: A ₅, L ₂(7), S ₅, Z ₃, Z ₄, S ₄, A ₄, D ₁₀, Hol(Z ₅), or Z ₃ ? Z ₄.     

On the prime graph of <Emphasis Type="Italic">PSL</Emphasis>(2, <Emphasis Type="Italic">p</Emphasis>) where <Emphasis Type="Italic">p</Emphasis> > 3 is a prime number

Let G be a finite group. We define the prime graph Γ(G) 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. Recently M. Hagie [5] determined finite groups G satisfying Γ(G) = Γ(S), where S is a sporadic simple group. Let p > 3 be a prime number. In this paper we determine finite groups G such that Γ(G) = Γ(PSL(2, p)). As a consequence of our results we prove that if p > 11 is a prime number and p ≢ 1 (mod 12), then PSL(2, p) is uniquely determined by its prime graph and so these groups are characterizable by their prime graph. The third author was supported in part by a grant from IPM (No. 84200024).     

Noncyclic Graph of a Group

We associate a graph Γ _G to a nonlocally cyclic group G (called the noncyclic graph of G) as follows: take G\ Cyc(G) as vertex set, where Cyc(G) = {x ? G| 〈x, y〉 is cyclic for all y ? G}, and join two vertices if they do not generate a cyclic subgroup. We study the properties of this graph and we establish some graph theoretical properties (such as regularity) of this graph in terms of the group ones. We prove that the clique number of Γ _G is finite if and only if Γ _G has no infinite clique. We prove that if G is a finite nilpotent group and H is a group with Γ _G  ? Γ _H and |Cyc(G)| = |Cyc(H)| = 1, then H is a finite nilpotent group. We give some examples of groups G whose noncyclic graphs are “unique”, i.e., if Γ _G  ? Γ _H for some group H, then G ? H. In view of these examples, we conjecture that every finite nonabelian simple group has a unique noncyclic graph. Also we give some examples of finite noncyclic groups G with the property that if Γ _G  ? Γ _H for some group H, then |G| = |H|. These suggest the question whether the latter property holds for all finite noncyclic groups.     

Quasi-permutation Representations of the Groups SU (3, q2) and PSU (3, q2)

A square matrix over the complex field with non-negative integral trace is called a quasi-permutation matrix. For a finite group G the minimal degree of a faithful permutation representation of G is denoted by p(G). The minimal degree of a faithful representation of G by quasi-permutation matrices over the rational and the complex numbers are denoted by q(G) and c(G) respectively. Finally r(G) denotes the minimal degree of a faithful rational valued complex character of G. In this paper p(G), q(G), c(G) and r(G) are calculated for the groups PSU (3, q²) and SU (3, q²).AMS Subject Classification (2000): 20C15     

Generic Modules Over a Class of Drinfeld's Quantum Doubles

Let k be a field and A _n (ω) be the Taft's n ²-dimensional Hopf algebras. When n is odd, the Drinfeld quantum double D(A _n (ω)) of A _n (ω) is a Ribbon Hopf algebra. In the previous articles, we constructed an n ⁴-dimensional Hopf algebra H _n (p, q) which is isomorphic to D(A _n (ω)) if p ≠ 0 and q = ω^?1, and studied the finite dimensional representations of H _n (1, q). We showed that the basic algebra of any nonsimple block of H _n (1, q) is independent of n. In this article, we examine the infinite representations of H ₂(1, ? 1), or equivalently of H _n (1, q)?D(A _n (ω)) for any n ≥ 2. We investigate the indecomposable and algebraically compact modules over H ₂(1, ? 1), describe the structures of these modules and classify them under the elementary equivalence.     

On the Heterochromatic Number of Hypergraphs Associated to Geometric Graphs and to Matroids

The heterochromatic number h _c (H) of a non-empty hypergraph H is the smallest integer k such that for every colouring of the vertices of H with exactly k colours, there is a hyperedge of H all of whose vertices have different colours. We denote by ν(H) the number of vertices of H and by τ(H) the size of the smallest set containing at least two vertices of each hyperedge of H. For a complete geometric graph G with n ≥ 3 vertices let H = H(G) be the hypergraph whose vertices are the edges of G and whose hyperedges are the edge sets of plane spanning trees of G. We prove that if G has at most one interior vertex, then h _c (H) = ν(H) ? τ(H) + 2. We also show that h _c (H) = ν(H) ? τ(H) + 2 whenever H is a hypergraph with vertex set and hyperedge set given by the ground set and the bases of a matroid, respectively.