Applications of the Frobenius Formulas for the Characters of the Symmetric Group and the Hecke Algebras of Type A

We give a simple combinatorial proof of Ram's rule for computing the characters of the Hecke Algebra. We also establish a relationship between the characters of the Hecke algebra and the Kronecker product of two irreducible representations of the Symmetric Group which allows us to give new combinatorial interpretations to the Kronecker product of two Schur functions evaluated at a Schur function of hook shape or a two row shape. We also give a formula for the regular representation of the Hecke algebra.     

Cyclic Characters of Symmetric Groups

We consider characters of finite symmetric groups induced from linear characters of cyclic subgroups. A new approach to Stembridge's result on their decomposition into irreducible components is presented. In the special case of a subgroup generated by a cycle of longest possible length, this amounts to a short proof of the Krakiewicz-Weyman theorem.     

On Young's Orthogonal Form and the Characters of the Alternating Group

A combinatorial method of determining the characters of the alternating group is presented. We use matrix representations, due to Thrall, that are closely related to Young's orthogonal form of representations of the symmetric group. The characters are computed directly from matrix entries of these representations and entries of the character table of the symmetric group.     

对称群S5的表示环

本文利用有限群特征标理论计算了对称群S₅的所有不可约复表示的幂公式.根据求解幂公式过程中得到的S₅任意两个不可约表示张量积的分解情况,作者刻画了S₅上表示环r(S₅)及其若干结构性质,如极小生成元关系式表达、单位群、本原幂等元、行列式与Casimir数.     

Rapidly Mixing Random Walks and Bounds on Characters of the Symmetric Group

We investigate mixing of random walks on S _n and A _n generated by permutations of a given cycle structure. The approach follows methods developed by Diaconis, which requires certain estimates on characters of the symmetric group and uses combinatorics of Young tableaux. We conclude with conjectures and open problems.     

Mixed Partitions of Projective Geometries

Starting from a linear collineation of PG(2n–1,q) suitably constructed from a Singer cycle of GL(n,q), we prove the existence of a partition of PG(2n–1,q) consisting of two (n–1)-subspaces and caps, all having size (qⁿ–1)/(q–1) or (qⁿ–1)/(q+1) according as n is odd or even respectively. Similar partitions of quadrics or hermitian varieties into two maximal totally isotropic subspaces and caps of equal size are also obtained. We finally consider the possibility of partitioning the Segre variety of PG(8,q) into caps of size q²+q+1 which are Veronese surfaces.     

A Rational-Function Identity Related to the Murnaghan–Nakayama Formula for the Characters of S n

The Murnaghan–Nakayama formula for the characters of S _n is derived from Young's seminormal representation, by a direct combinatorial argument. The main idea is a rational function identity which when stated in a more general form involves Möbius functions of posets whose Hasse diagrams have a planar embedding. These ideas are also used to give an elementary exposition of the main properties of Young's seminormal representations.     

Symmetric Group Decomposition Numbers for Some Three-Part Partitions

The decomposition numbers d _λμ for Specht modules S ^λ of partitions λ with three parts and whose third part is at most p ? 1 are obtained by induction and by using “node removal rules” developed in James and Williams (2000 James , G. D. , Williams , A. L. (2000). Decomposition numbers of symmetric groups by induction. J. Algebra 228:119–142. [CSA] [CROSSREF]  [Google Scholar]).     

Symmetric complete intersections

We consider complete intersection ideals in a polynomial ring over a field of characteristic zero that are stable under the action of the symmetric group permuting the variables. We determine the possible representation types for these ideals and describe formulas for the graded characters of the corresponding quotient rings.     

Reduced Words and Plane Partitions

Let w ₀ be the element of maximal length in thesymmetric group S _n , and let Red(w ₀) bethe set of all reduced words for w ₀. We prove the identity which generalizes Stanley's [20] formula forthe cardinality of Red(w ₀), and Macdonald's [11] formula .Our approach uses anobservation, based on a result by Wachs [21], that evaluation of certainspecializations of Schubert polynomials is essentially equivalent toenumeration of plane partitions whose parts are bounded from above. Thus,enumerative results for reduced words can be obtained from the correspondingstatements about plane partitions, and vice versa. In particular, identity(*) follows from Proctor's [14] formula for the number of planepartitions of a staircase shape, with bounded largest part.Similar results are obtained for other permutations and shapes;q-analogues are also given.     

A geometric approach to the Kronecker problem I: The two row case

Given two irreducible representations μ, v of the symmetric group S _d , the Kronecker problem is to find an explicit rule, giving the multiplicity of an irreducible representation, λ, of S _d , in the tensor product of μ and v. We propose a geometric approach to investigate this problem. We demonstrate its effectiveness by obtaining explicit formulas for the tensor product multiplicities, when the irreducible representations are parameterized by partitions with at most two rows.     

The Bruhat Order on the Involutions of the Symmetric Group

In this paper we study the partially ordered set of the involutions of the symmetric group S _n with the order induced by the Bruhat order of S _n. We prove that this is a graded poset, with rank function given by the average of the number of inversions and the number of excedances, and that it is lexicographically shellable, hence Cohen-Macaulay, and Eulerian.     

Properties of Some Character Tables Related to the Symmetric Groups

We determine invariants like the Smith normal form and the determinant for certain integral matrices which arise from the character tables of the symmetric groups S_n and their double covers. In particular, we give a simple computation, based on the theory of Hall-Littlewood symmetric functions, of the determinant of the regular character table _RC of S_n with respect to an integer r 2. This result had earlier been proved by Olsson in a longer and more indirect manner. As a consequence, we obtain a new proof of the Mathas Conjecture on the determinant of the Cartan matrix of the Iwahori-Hecke algebra. When r is prime we determine the Smith normal form of _RC. Taking r large yields the Smith normal form of the full character table of S_n. Analogous results are then given for spin characters.Partially supported by The Danish National Research Council.Partially supported by NSF grant #DMS-9988459.     

对称群的分歧数据系统分类

含特征标的分歧数据系统能被用来分类PM箭图Hopf代数.本文给出了对称群Sn(n≠6)上含特征标的分歧数据系统的同构类个数的计算公式.     

Automorphisms and Isomorphisms of Symmetric and Affine Designs

Given a finite group G, for all sufficiently large d and for each q > 3 there are symmetric designs and affine designs having the same parameters as PG(d, q) and AG(d, q), respectively, and having full automorphism group isomorphic to G.     

Designs and Representation of the Symmetric Group

We study (generalized) designs supported by words of given composition. We characterize them in terms of orthogonality relations with Specht modules; we define some zonal functions for the symmetric group and we give a closed formula for them, indexed on ordered pair of semi-standard generalized tableaux: Hahn polynomials are a particular case. We derive an algorithm to test if a set is a design. We use it to search designs in some ternary self-dual codes.     

The Round Functions of Cryptosystem PGM Generate the Symmetric Group

S. S. Magliveras et al. have described symmetric and public key cryptosystems based on logarithmic signatures (also known as group bases) for finite permutation groups. In this paper we show that if G is a nontrivial finite group which is not cyclic of order a prime, or the square of a prime, then the round (or encryption) functions of these systems, that are the permutations of G induced by the exact-transversal logarithmic signatures (also known as transversal group bases), generate the full symmetric group on G. This answers a question of S. S. Magliveras, D. R. Stinson and Tran van Trung. AMS Classification:94A60, 20B15, 20B20     

Zeros in Tables of Characters for the Groups <Emphasis Type="Italic">S</Emphasis><Subscript>n</Subscript> and <Emphasis Type="Italic">A</Emphasis><Subscript>n</Subscript>. II

Let P(n) be the set of all partitions of a natural number n. In the representation theory of symmetric groups, for every partition α ∈ P(n), the partition h(α) ∈ P(n) is defined so as to produce a certain set of zeros in the character table for S_n. Previously, the analog f(α) of h(α) was obtained pointing out an extra set of zeros in the table mentioned. Namely, h(α) is greatest (under the lexicographic ordering ≤) of the partitions β of n such that χ^α(g_β) ≠ 0, and f(α) is greatest of the partitions γ of n that are opposite in sign to h(α) and are such that χ^α(g_γ) ≠ 0, where χ^α is an irreducible character of S_n, indexed by α, and g_β is an element in the conjugacy class of S_n, indexed by β. For α ∈ P(n), under some natural restrictions, here, we construct new partitions h′(α) and f′(α) of n possessing the following properties. (A) Let α ∈ P(n) and n ⩾ 3. Then h′(α) is identical is sign to h(α), χ^α(g_h′(α)) ≠ 0, but χ^α(g_γ) = 0 for all γ ∈ P(n) such that the sign of γ coincides with one of h(α), and h′(α) < γ < h(α). (B) Let α ∈ P(n), α ≠ α′, and n ⩾ 4. Then f′(α) is identical in sign to f(α), χ^α(g_f′(α)) ≠ 0, but χ^α(g_γ) = 0 for all γ ∈ P(n) such that the sign of γ coincides with one of f(α), and f′(α) < γ < f(α). The results obtained are then applied to study pairs of semiproportional irreducible characters in A_n. Supported by RFBR grant No. 04-01-00463. __________ Translated from Algebra i Logika, Vol. 44, No. 6, pp. 643–663, November–December, 2005.     

Homotopy of Non-Modular Partitions and the Whitehouse Module

We present a class of subposets of the partition lattice _n with the following property: The order complex is homotopy equivalent to the order complex of _n – 1, and the S _n -module structure of the homology coincides with a recently discovered lifting of the S _n – 1-action on the homology of _n – 1. This is the Whitehouse representation on Robinson's space of fully-grown trees, and has also appeared in work of Getzler and Kapranov, Mathieu, Hanlon and Stanley, and Babson et al.One example is the subposet P _n ⁿ – 1 of the lattice of set partitions _n , obtained by removing all elements with a unique nontrivial block. More generally, for 2 k n – 1, let Q _n ^k denote the subposet of the partition lattice _n obtained by removing all elements with a unique nontrivial block of size equal to k, and let P _n ^k = _{i = 2} ^k Q _n ⁱ . We show that P _n ^k is Cohen-Macaulay, and that P _n ^k and Q _n ^k are both homotopy equivalent to a wedge of spheres of dimension (n – 4), with Betti number . The posets Q _n ^k are neither shellable nor Cohen-Macaulay. We show that the S _n -module structure of the homology generalises the Whitehouse module in a simple way.We also present a short proof of the well-known result that rank-selection in a poset preserves the Cohen-Macaulay property.