A combinatorial proof of a Weyl type formula for hook Schur polynomials

Making use of a Howe duality involving the infinite-dimensional Lie superalgebra $\hgltwo$ and the finite-dimensional group $GL_l$ we derive a character formula for a certain class of irreducible quasi-finite representations of $\hgltwo$ in terms of hook Schur functions. We use the reduction procedure of $\hgltwo$ to $\hat{gl}_{n|n}$ to derive a character formula for a certain class of level 1 highest weight irreducible representations of $\hat{gl}_{n|n}$, the affine Lie supe...

Finding a combinatorial interpretation of the multiplicities of each irreducible representation of the symmetric group $S_n$ in the restriction of an irreducible polynomial representation of the general linear group $GL_n(\mathbb{C})$ remains an interesting open problem in algebraic combinatorics. In this paper we interpret the multiplicities of all irreducible representations of $S_n$ in the restriction of an irreducible polynomial representation of $GL_n(\mathbb{C})$ indexe...

A new combinatorial interpretation of the Howe dual pair $(\hat{\frak{gl}}_{\infty|\infty},\frak{gl}_n)$ acting on an infinite dimensional Fock space $\frak{F}^n$ of level $n$ is presented. The character of a quasi-finite irreducible highest weight representation of $\hat{\frak{gl}}_{\infty|\infty}$ occurring in $\frak{F}^n$ is realized in terms of certain bitableaux of skew shapes. We study a general combinatorics of these bitableaux, including Robinson-Schensted-Knuth corre...

We compute an explicit formula the Hilbert (Poincar\'e) series for the ring of hook Schur functions and (equivalently) the generating function for partitions which fit in a $(k,l)$-hook.

We prove a formula for $S_n$ characters which are indexed by the partitions in the $(k,\ell)$ hook. The proof applies a combinatorial part of the theory of Lie superalgebras.

We introduce a quasisymmetric generalization of Berele and Regev's hook Schur functions and prove that these new quasisymmetric hook Schur functions decompose the hook Schur functions in a natural way. We examine the combinatorics of the quasisymmetric hook Schur functions, providing a relationship to Gessel's fundamental quasisymmetric functions and an analogue of the Robinson-Schensted-Knuth algorithm. We also prove that the multiplication of quasisymmetric hook Schur funct...

The paper is devoted to the generalization of Lusztig's q-analog of weight multiplicities to the Lie superalgebras gl(n,m) and spo(2n,M). We define such q-analogs K_{lambda,mu}(q) for the typical modules and for the irreducible covariant tensor gl(n,m)-modules of highest weight lambda. For gl(n,m), the defined polynomials have nonnegative integer coefficients if the weight mu is dominant. For spo(2n,M), we show that the positivity property holds when mu is dominant and suffic...

We study a dual pair of general linear Lie superalgebras in the sense of R. Howe. We give an explicit multiplicity-free decomposition of a symmetric and skew-symmetric algebra (in the super sense) under the action of the dual pair and present explicit formulas for the highest weight vectors in each isotypic subspace of the symmetric algebra. We give an explicit multiplicity-free decomposition into irreducible $gl(m|n)$-modules of the symmetric and skew-symmetric algebras of t...

Let $\fg$ be the Lie superalgebra $\fgl(m,n).$ Algorithms for computing the composition factors and multiplicities of Kac modules for $\fg$ were given by the second author in 1996, and by J. Brundan in 2003. We give a combinatorial proof of the equivalence between the two algorithms. The proof uses weight and cap diagrams introduced by Brundan and C. Stroppel, and cancelations between paths in a graph $\mathcal{G}$ defined using these diagrams. Each vertex of $\mathcal{G}$ ...

In this paper, we give a combinatorial rule to calculate the decomposition of the tensor product (Kronecker product) of two irreducible complex representations of the symmetric group ${\mathfrak S}_n$, when one of the representations corresponds to a hook $(n-m, 1^m)$.