• Corpus ID: 119595235

Character polynomials for two rows and hook partitions

  title={Character polynomials for two rows and hook partitions},
  author={Ahmed Umer Ashraf},
  journal={arXiv: Combinatorics},
  • A. Ashraf
  • Published 21 December 2018
  • Mathematics
  • arXiv: Combinatorics
Representation theory of the symmetric group $\mathfrak{S}_n$ has a very distinctive combinatorial flavor. The conjugacy classes as well as the irreducible characters are indexed by integer partitions $\lambda \vdash n$. We introduce class functions on $\mathfrak{S}_n$ that count the number of certain tilings of Young diagrams. The counting interpretation gives a uniform expression of these class functions in the ring of character polynomials, as defined by \cite{murnaghanfirst}. A modern… 

Figures from this paper

FI-modules and stability for representations of symmetric groups

In this paper we introduce and develop the theory of FI-modules. We apply this theory to obtain new theorems about: - the cohomology of the configuration space of n distinct ordered points on an

An inversion formula involving partitions

In this note we outline a combinatorial proof of an inversion formula involving partitions of a number. This formula can be used to obtain the theory of symmetric group characters in a purely

Character Polynomials, their q-Analogs and the Kronecker Product

An "umbral" version and a recursive combinatorial construction of character polynomials are given to show their remarkable simplicity and it is shown that they have a natural counterpart in the standard Hecke algebra.

The characters of the symmetric group.

    F. Murnaghan
    Proceedings of the National Academy of Sciences of the United States of America
  • 1971
This paper shows how to derive from Frobenius' formula the characters of an element of S(n), the symmetric group on any number, n, of symbols, which has at least one cycle of length k, k = 2, 3,..., n.

Generating functions for irreducible characters of Sn indexed with multiple hooks

Nous presentons de nouvelles expressions pour des fonctions generatrices de caracteres irreductibles du groupe symetrique S n . Ces fonctions generatrices sont de la forme Σ * λ X λ μ q λ ou la somme

Symmetric functions and Hall polynomials

I. Symmetric functions II. Hall polynomials III. HallLittlewood symmetric functions IV. The characters of GLn over a finite field V. The Hecke ring of GLn over a finite field VI. Symmetric functions


We cover some of the foundational results of representation theory including Maschke’s Theorem, Schur’s Lemma, and the Schur Orthogonality Relations. We consider character theory, constructions of

Applied finite group actions

0. Labeled Structures.- 1. Unlabeled Structures.- 2. Enumeration of Unlabeled Structures.- 3. Enumeration by Weight.- 4. Enumeration by Stabilizer Class.- 5. Poset and Semigroup Actions.- 6.