plays an important role in the Garsia-Haglund proof of the q, t-Catalan conjecture, [2]. Let ΛQ(q,t) be the space of symmetric functions of degree n, over the field of rational functions Q(q, t), and let ∇ : ΛQ(q,t) → Λ n Q(q,t) be the Garsia-Bergeron operator. By studying recursions, Garsia and Haglund show that the coefficient of the elementary symmetric function en(X) in the image ∇(En,k(X))...

A new fermionic formula for the unrestricted Kostka polynomials of type A (1) n−1 is presented. This formula is different from the one given by Hatayama et al. and is valid for all crystal paths based on Kirillov–Reshetihkin modules, not just for the symmetric and anti-symmetric case. The fermionic formula can be interpreted in terms of a new set of unrestricted rigged configurations. For the p...

plays an important role in the Garsia-Haglund proof of the q, t-Catalan conjecture, [2]. Let ΛQ(q,t) be the space of symmetric functions of degree n, over the field of rational functions Q(q, t), and let ∇ : ΛQ(q,t) → ΛQ(q,t) be the Garsia-Bergeron operator. By studying recursions, Garsia and Haglund show that the coefficient of the elementary symmetric function en(X) in the image∇(En,k(X)) of ...

For positive integers n and l, we study the cyclic U(gl n )-module generated by the l-th power of the α-determinant det(X). This cyclic module is isomorphic to the n-th tensor space (Sym(C)) of the symmetric l-th tensor space of C for all but finite exceptional values of α. If α is exceptional, then the cyclic module is equivalent to a proper submodule of (Sym(C)), i.e. the multiplicities of se...

The following item is made available as a courtesy to scholars by the author(s) and Drexel University Library and may contain materials and content, including computer code and tags, artwork, text, graphics, images, and illustrations (Material) which may be protected by copyright law. Unless otherwise noted, the Material is made available for non profit and educational purposes, such as researc...

Bennett et al. [2] presented a recursive algorithm to create a family of partitions from one or several partitions. They were mainly interested in the cases when we begin with a single square partition or with several partitions with only one part. The cardinalities of those families of partitions are the Catalan and ballot numbers, respectively. In this paper we present a non-recursive descrip...

Let K be a field of characteristic two, and let λ be a two-part partition of some natural number r. Denote the permutation module corresponding to the (maximal) Young subgroup Σλ in Σr byM . We construct a full set of orthogonal primitive idempotents of the centraliser subalgebra SK(λ) = 1λSK(2, r)1λ = EndKΣr (M ) of the Schur algebra SK(2, r). These idempotents are naturally in one-to-one corr...