The Minimal Number of Cyclic Generators of the Symmetric and Alternating Groups

The aim of this note is to find the minimal number of generators of the symmetric group S _n and alternating group A _n , when the generators are cycles of length at most k. The approach is constructive.     

Maximal Strings in the Crystal Graph of Spin Representations of the Symmetric and Alternating Groups

We define a block-reduced version of the crystal graph of spin representations of the symmetric and alternating groups, and separate it into layers, each obtained by translating the previous layer and, possibly, adding new defect zero blocks. We demonstrate that each layer has weight-preserving central symmetry, and study the sequence of weights occurring in the maximal strings.

The Broué conjecture, that a block with abelian defect group is derived equivalent to its Brauer correspondent, has been proven for blocks of cyclic defect group and verified for many other blocks. This article is part of a study of the spin block case.     

OD-Characterization of Alternating and Symmetric Groups of Degree p+5

In this paper,it is proved that all the alternating groups A_(p+5) are ODcharacterizable and the symmetric groups S_(p+5) are 3-fold OD-characterizable,where p + 4 is a composite number and p + 6 is a prime and 5≠p∈π(1000!).     

On the Connectivity of Proper Power Graphs of Finite Groups

We study the connectivity of proper power graphs of some family of finite groups including nilpotent groups, groups with a nontrivial partition, and symmetric and alternating groups. Also, for such a group, the corresponding proper power graph has diameter at most 26 whenever it is connected.     

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.     

Superlocals in Symmetric and Alternating Groups

On Aschbacher's definition, a subgroup N of a finite group is called a -superlocal for a prime if . We describe the -superlocals in symmetric and alternating groups, thereby resolving part way Problem 11.3 in the Kourovka Notebook [3].     

4度对称循环图的分类(英文)

本文刻划了所有4度有向和无内循环图．     

The Tilting Tensor Product Theorem and Decomposition Numbers for Symmetric Groups

We show how the tilting tensor product theorem for algebraic groups implies a reduction formula for decomposition numbers of the symmetric group. We use this to prove generalisations of various theorems of Erdmann and of James and Williams. Supported by Nuffield grant scheme NUF-NAL 02. Preliminary work on this paper was undertaken at the Isaac Newton Institute as part of the programme on Symmetric Functions and Macdonald Polynomials.     

The Lie Module Function for Symmetric Groups #

Let V be a ? G-module where ? is the field of all complex numbers and G is a symmetric group. The purpose of this article is to give a method of analyzing the Lie powers L ⁿ (V ), for every positive integer n, by making use of the recent work of Bryant.     

Alternating permutations and symmetric functions

We use the theory of symmetric functions to enumerate various classes of alternating permutations w of {1,2,…,n}. These classes include the following: (1) both w and w⁻¹ are alternating, (2) w has certain special shapes, such as (m−1,m−2,…,1), under the RSK algorithm, (3) w has a specified cycle type, and (4) w has a specified number of fixed points. We also enumerate alternating permutations of a multiset. Most of our formulas are umbral expressions where after expanding the expression in powers of a variable E, Ek is interpreted as the Euler number Ek. As a small corollary, we obtain a combinatorial interpretation of the coefficients of an asymptotic expansion appearing in Ramanujan's “Lost” Notebook.     

Normal coverings of finite symmetric and alternating groups

In this paper we investigate the minimum number of maximal subgroups Hi, i=1,…,k of the symmetric group Sn (or the alternating group An) such that each element in the group Sn (respectively An) lies in some conjugate of one of the Hi. We prove that this number lies between a?(n) and bn for certain constants a,b, where ?(n) is the Euler phi-function, and we show that the number depends on the arithmetical complexity of n. Moreover in the case where n is divisible by at most two primes, we obtain an upper bound of 2+?(n)/2, and we determine the exact value for Sn when n is odd and for An when n is even.     

Maximal 2-Local Geometries for the Symmetric Groups

Abstract

The set 𝒩_max (G, T) consisting of all maximal 2-local subgroups of G = Sym(n) which contain T, a Sylow 2-subgroup of G, is investigated. In addition to determining the structure of the subgroups in 𝒩_max (G, T), the simplicial sets of maximal rank are classified.     

Alternating Paths along Axis-Parallel Segments

It is shown that for a set S of n pairwise disjoint axis-parallel line segments in the plane there is a simple alternating path of length . This bound is best possible in the worst case. In the special case that the n pairwise disjoint axis-parallel line segments are protruded (that is, if the intersection point of the lines through every two nonparallel segments is not visible from both segments), there is a simple alternating path of length n. Work on this paper was partially supported by National Science Foundation grants CCR-0049093 and IIS-0121562. A preliminary version of this paper has appeared in the Proceedings of the 8th International Workshop on Algorithms and Data Structures (Ottawa, ON, 2003), vol. 2748 of Lecture Notes on Computer Science, Springer, Berlin, 2003, pp. 389–400.     

Restrictions on the structure of subgroup lattices of finite alternating and symmetric groups

Let G be a finite alternating or symmetric group. We describe an infinite class of finite lattices, none of which is isomorphic to any interval [H,G] in the subgroup lattice of G.     

Comparison of Gelfand-Tsetlin Bases for Alternating and Symmetric Groups

Young’s orthogonal basis is a classical basis for an irreducible representation of a symmetric group. This basis happens to be a Gelfand-Tsetlin basis for the chain of symmetric groups. It is well-known that the chain of alternating groups, just like the chain of symmetric groups, has multiplicity-free restrictions for irreducible representations. Therefore each irreducible representation of an alternating group also admits Gelfand-Tsetlin bases. Moreover, each such representation is either the restriction of, or a subrepresentation of, the restriction of an irreducible representation of a symmetric group. In this article, we describe a recursive algorithm to write down the expansion of each Gelfand-Tsetlin basis vector for an irreducible representation of an alternating group in terms of Young’s orthogonal basis of the ambient representation of the symmetric group. This algorithm is implemented with the Sage Mathematical Software.     

Automorphisms of Maps with a Given Underlying Graph and Their Application to Enumeration

A graph is called a semi-regular graph if its automorphism group action on its ordered pair of adjacent vertices is semi-regular. In this paper, a necessary and sufficient condition for an automorphism of the graph F to be an automorphism of a map with the underlying graph F is obtained. Using this result, all orientation-preserving automorphisms of maps on surfaces (orientable and non-orientable) or just orientable surfaces with a given underlying semi-regular graph F are determined. Formulas for the numbers of non-equivalent embeddings of this kind of graphs on surfaces (orientable, non-orientable or both) are established, and especially, the non-equivalent embeddings of circulant graphs of a prime order on orientable, non-orientable and general surfaces are enumerated.     

Prime Divisibility Among Degrees of Solvable Groups

Abstract

Let G be a finite, nonabelian, solvable group. Following work by D. Benjamin, we conjecture that some prime must divide at least a third of the irreducible character degrees of G. Benjamin was able to show the conjecture is true if all primes divide at most 3 degrees. We extend this result by showing if primes divide at most 4 degrees, then G has at most 12 degrees. We also present an example showing our result is best possible.     

维数分别为51和52的对称群的OD-刻画

利用有限群的阶和它的次数型分别对对称群S51和S_（52）进行了刻画,得到：对称群S_（51）和S_（52）均可3-重OD-刻画.