Abstract. Inhomogeneous lattice paths are introduced as ordered sequences of rectangular Young tableaux thereby generalizing recent work on the Kostka polynomials by Nakayashiki and Yamada and by Lascoux, Leclerc and Thibon. Motivated by these works and by Kashiwara’s theory of crystal bases we define a statistic on paths yielding two novel classes of polynomials. One of these provides a generalization of the Kostka polynomials while the other, which we name the An−1 supernomial, is a q-deformation of the expansion coefficients of products of Schur polynomials. Many well-known results for Kostka polynomials are extended leading to representations of our polynomials in terms of a charge statistic on Littlewood–Richardson tableaux and in term...
A long-standing theme in algebraic combinatorics is to study bases of the rings of symmetric functio...
The combinatorial q, t-Catalan numbers are weighted sums of Dyck paths introduced by J. Haglund and ...
AbstractThis work is first concerned with some properties of the Young–Fibonacci insertion algorithm...
Inhomogeneous lattice paths are introduced as ordered sequences of rectangular Young tablea...
AbstractThe k-Young lattice Yk is a partial order on partitions with no part larger than k. This wea...
A new fermionic formula for the unrestricted Kostka polynomials of type $A_{n-1}^{(1)}$ is ...
Lapoint, L. Instituto de Matemática y Física, Universidad de Talca, Casilla 747, Talca, ChileThe k-Y...
AbstractA new fermionic formula for the unrestricted Kostka polynomials of type An−1(1) is presented...
The Kostka numbers Kλµ are important in several areas of mathe-matics, including symmetric function ...
AbstractThere is a certain family of Poincaré polynomials that arise naturally in geometry. They sat...
An algebraic iterative formula for the spin Kostka-Foulkes polynomial $K^-_{\xi\mu}(t)$ is given usi...
AbstractWe use Kashiwara–Nakashima combinatorics of crystal graphs associated with the roots systems...
We define a bijection from Littlewood-Richardson tableaux to rigged configurations and show that it ...
Combinatorics on tableaux-like objects and understanding the relationships of various polynomial bas...
AbstractThis is a combinatorial study of the Poincaré polynomials of isotypic components of a natura...
A long-standing theme in algebraic combinatorics is to study bases of the rings of symmetric functio...
The combinatorial q, t-Catalan numbers are weighted sums of Dyck paths introduced by J. Haglund and ...
AbstractThis work is first concerned with some properties of the Young–Fibonacci insertion algorithm...
Inhomogeneous lattice paths are introduced as ordered sequences of rectangular Young tablea...
AbstractThe k-Young lattice Yk is a partial order on partitions with no part larger than k. This wea...
A new fermionic formula for the unrestricted Kostka polynomials of type $A_{n-1}^{(1)}$ is ...
Lapoint, L. Instituto de Matemática y Física, Universidad de Talca, Casilla 747, Talca, ChileThe k-Y...
AbstractA new fermionic formula for the unrestricted Kostka polynomials of type An−1(1) is presented...
The Kostka numbers Kλµ are important in several areas of mathe-matics, including symmetric function ...
AbstractThere is a certain family of Poincaré polynomials that arise naturally in geometry. They sat...
An algebraic iterative formula for the spin Kostka-Foulkes polynomial $K^-_{\xi\mu}(t)$ is given usi...
AbstractWe use Kashiwara–Nakashima combinatorics of crystal graphs associated with the roots systems...
We define a bijection from Littlewood-Richardson tableaux to rigged configurations and show that it ...
Combinatorics on tableaux-like objects and understanding the relationships of various polynomial bas...
AbstractThis is a combinatorial study of the Poincaré polynomials of isotypic components of a natura...
A long-standing theme in algebraic combinatorics is to study bases of the rings of symmetric functio...
The combinatorial q, t-Catalan numbers are weighted sums of Dyck paths introduced by J. Haglund and ...
AbstractThis work is first concerned with some properties of the Young–Fibonacci insertion algorithm...