On Symmetric Cayley Graphs of Valency Eleven

A Cayley graph Γ=Cay(G,S)is said to be normal if G is normal in Aut Γ.In this paper,we investigate the normality problem of the connected 11-valent symmetric Cayley graphs Γ of finite nonabelian simple groups G,where the vertex stabilizer Av is soluble for A=Aut Γ and v ∈ VΓ.We prove that either Γ is normal or G=A5,A10,A54,A274,A549 or A1099.Further,11-valent symmetric nonnormal Cayley graphs of A5,A54 and A274 are constructed.This provides some more examples of nonnormal 11-valent symmetric Cayley graphs of finite nonabelian simple groups after the first graph of this kind(of valency 11)was constructed by Fang,Ma and Wang in 2011.     

Symmetric Graphs and Flag Graphs

 With any G-symmetric graph Γ admitting a nontrivial G-invariant partition , we may associate a natural “cross-sectional” geometry, namely the 1-design in which for and if and only if α is adjacent to at least one vertex in C, where and is the neighbourhood of B in the quotient graph of Γ with respect to . In a vast number of cases, the dual 1-design of contains no repeated blocks, that is, distinct vertices of B are incident in with distinct subsets of blocks of . The purpose of this paper is to give a general construction of such graphs, and then prove that it produces all of them. In particular, we show that such graphs can be reconstructed from and the induced action of G on . The construction reveals a close connection between such graphs and certain G-point-transitive and G-block-transitive 1-designs. By using this construction we give a characterization of G-symmetric graphs such that there is at most one edge between any two blocks of . This leads to, in a subsequent paper, a construction of G-symmetric graphs such that and each is incident in with vertices of B. The work was supported by a discovery-project grant from the Australian Research Council. Received April 24, 2001; in revised form October 9, 2002 Published online May 9, 2003     

On the Vertices of Simple Modules for Symmetric Groups

In this article, we are concerned with the computation of vertices of some series of simple modules for the symmetric group of n letters in odd characteristic. In the first, the second, and the third section of this work we recall some more or less general results that are needed in our proofs. The fourth section contains new ingredients (in terms of dimension) that play an important role in our proofs of the main results in the last section.     

On Translation Functors for General Linear and Symmetric Groups

In this paper we study the rational representation theory ofthe general linear group G = GL_n(F) over an algebraically closedfield F of characteristic p. Given Z/pZ, we define functorsTr and Tr, which, roughly speaking, are given by tensoring withthe natural G-module V and its dual V* respectively, and thenprojecting onto certain blocks determined by the residue . Infact, these functors can be viewed as special cases of Jantzen'stranslation functors. We prove a number of fundamental propertiesabout these functors and also certain closely related functorsthat arise in the modular representation theory of the symmetricgroup. 1991 Mathematics Subject Classification: 20G05, 20C05.     

On the Hawkes Graphs of Finite Groups

We study the properties and applications of the directed graph, introduced by Hawkes in 1968, of a finite group \( G \). The vertex set of \( \Gamma_{H}(G) \) coincides with \( \pi(G) \) and \( (p,q) \) is an edge if and only if \( q\in\pi(G/O_{p^{\prime},p}(G)) \). In the language of properties of this graph we obtain commutation conditions for all \( p \)-elements with all \( r \)-elements of \( G \), where \( p \) and \( r \) are distinct primes. We estimate the nilpotence length of a solvable finite group in terms of subgraphs of its Hawkes graph. Given an integer \( n>1 \), we find conditions for reconstructing the Hawkes graph of a finite group \( G \) from the Hawkes graphs of its \( n \) pairwise nonconjugate maximal subgroups. Using these results, we obtain some new tests for the membership of a solvable finite group in the well-known saturated formations.

     

On the Automorphism Groups of Cayley Graphs of Finite Simple Groups

Let G be a finite nonabelian simple group and let be a connectedundirected Cayley graph for G. The possible structures for thefull automorphism group Aut are specified. Then, for certainfinite simple groups G, a sufficient condition is given underwhich G is a normal subgroup of Aut. Finally, as an applicationof these results, several new half-transitive graphs are constructed.Some of these involve the sporadic simple groups G = J₁, J₄,Ly and BM, while others fall into two infinite families andinvolve the Ree simple groups and alternating groups. The twoinfinite families contain examples of half-transitive graphsof arbitrarily large valency.     

On Tensor Products of Modular Representations of Symmetric Groups

Let F be a field, and let _n be the symmetric group on n letters.In this paper we address the following question: given two irreducibleF_n-modules D₁ and D₂ of dimensions greater than 1, can it happenthat D₁ D₂ is irreducible? The answer is known to be ‘no’if char F = 0 [12] (see also [2] for some generalizations).So we assume from now on that F has positive characteristicp. The following conjecture was made in [4]. CONJECTURE. Let D₁ and D₂ be two irreducible F_n-modules of dimensionsgreater than 1. Then D₁ D₂ is irreducible if and only if p= 2, n = 2 + 4l for some positive integer l; one of the modulescorresponds to the partition (2l + 2, 2l) and the other correspondsto a partition of the form (n – 2j – 1, 2j 1), 0 j < l. Moreover, in the exceptional cases, one has The main result of this paper is the following theorem, whichestablishes a big part of the conjecture. 1991 Mathematics SubjectClassification 20C20, 20C30.     

On Decomposition Numbers and Branching Coefficients for Symmetric and Special Linear Groups

In this paper we find the multiplicities dim L()_– where is an arbitrary root and L() is an irreducible SL_n-module withhighest weight . We provide different bases of the correspondingweight spaces and outline some applications to the symmetricgroups. In particular we describe certain composition multiplicitiesin the modular branching rule. 1991 Mathematics Subject Classification:20C05, 20G05.     

关于Abel群上Cayley图的Hamilton圈分解

设Ｇ（Ｆ，Ｔ∩Ｔ＾－１）是有限Ａｂｅｌ群Ｆ上的Ｃａｙｌｅｙ图，Ｔ∩Ｔ＾－１只含２阶元，此文证明了当Ｔ是Ｆ的极小生成元集时，若ｄ（Ｇ）＝２ｋ，则Ｇ是ｋ个边不相交的Ｈａｍｉｌｔｏｎ圈的并，若ｄ（Ｇ）＝２ｋ＋１，则Ｇ是ｋ个边不相交的Ｈａｍｉｌｔｏｎ圈与一个１－因子的并。     

Symmetric Groups and Lattices

This paper deals with various problems in lattice theory involving local extrema. In particular, we construct infinite series of highly symmetric spherical 3-designs which include some of the examples constructed in [9] in dimensions 5 and 7. We also construct new types of dual-extreme lattices.Received June 29, 2002; in final form January 14, 2003 Published online May 16, 2003     

Generating Infinite Symmetric Groups

Let S = Sym(     

Divisibility Graph for Symmetric and Alternating Groups

Let X be a nonempty set of positive integers and X* = X?{1}. The divisibility graph D(X) has X* as the vertex set, and there is an edge connecting a and b with a, b ∈ X* whenever a divides b or b divides a. Let X = cs(G) be the set of conjugacy class sizes of a group G. In this case, we denote D(cs(G)) by D(G). In this paper, we will find the number of connected components of D(G) where G is the symmetric group S _n or is the alternating group A _n .     

Heptavalent Symmetric Graphs with Certain Conditions

A graph Γ is said to be symmetric if its automorphism group Aut(Γ)acts transitively on the arc set of Γ.We show that if Γ is a finite connected heptavalent symmetric graph with solvable stabilizer admitting a vertex-transitive non-abelian simple group G of automorphisms,then either G is normal in Aut(Γ),or Aut(Γ)contains a non-abelian simple normal subgroup T such that G≤T and(G,T)is explicitly given as one of 11 possible exceptional pairs of non-abelian simple groups.If G is arc-transitive,then G is always normal in Aut(r),and if G is regular on the vertices of Γ,then the number of possible exceptional pairs(G,T)is reduced to 5.     

Locally Symmetric Graphs of Girth 4

We classify the family of connected, locally symmetric graphs of girth 4 (finite and infinite). They are all regular, with the exception of the complete bipartite graph . There are, up to isomorphism, exactly four such k‐regular graphs for every , one for , two for , and exactly three for every infinite cardinal k. In the last paragraph, we consider locally symmetric graphs of girth >4.