AbstractThe Bernstein operators allow one to build recursively the Schur functions. We present a recursion formula for k-Schur functions at t=1 based on combinatorial operators that generalize the Bernstein operators. The recursion leads immediately to a combinatorial interpretation for the expansion coefficients of k-Schur functions at t=1 in terms of homogeneous symmetric functions
AbstractWe provide a new, simple and direct combinatorial proof of the equivalence of the determinan...
AbstractWe translate Goulden's combinatorial proof of the Jacobi-Trudi identity into the language of...
AbstractThe operator ∇ of F. Bergeron, Garsia, Haiman and Tesler [F. Bergeron, A. Garsia, M. Haiman,...
AbstractThe Bernstein operators allow one to build recursively the Schur functions. We present a rec...
AbstractWe study k-Schur functions characterized by k-tableaux, proving combinatorial properties suc...
Retrieved November 2, 2007 from http://xxx.lanl.gov/find/grp_math/1/au:+Morse_J/0/1/0/all/0/1.We con...
Advances in Mathematics, 213(1), pp. 183-204.We study k-Schur functions characterized by k-tableaux,...
This thesis proves a special case of the $k$-Littlewood--Richardson rule, which is analogous to the ...
AbstractWe introduce non-commutative analogs of k-Schur functions of Lapointe–Lascoux and Morse. We ...
AbstractWe obtain general identities for the product of two Schur functions in the case where one of...
AbstractWe provide a new, simple and direct combinatorial proof of the equivalence of the determinan...
We give several explicit combinatorial formulas for the expansion of k-Schur functions indexed by ma...
The understanding of the space of symmetric functions is gained through the study of its bases. Cert...
AbstractWe prove the Murnaghan–Nakayama rule for k-Schur functions of Lapointe and Morse, that is, w...
AbstractWe present several identities involving staircase Schur functions. These identities are then...
AbstractWe provide a new, simple and direct combinatorial proof of the equivalence of the determinan...
AbstractWe translate Goulden's combinatorial proof of the Jacobi-Trudi identity into the language of...
AbstractThe operator ∇ of F. Bergeron, Garsia, Haiman and Tesler [F. Bergeron, A. Garsia, M. Haiman,...
AbstractThe Bernstein operators allow one to build recursively the Schur functions. We present a rec...
AbstractWe study k-Schur functions characterized by k-tableaux, proving combinatorial properties suc...
Retrieved November 2, 2007 from http://xxx.lanl.gov/find/grp_math/1/au:+Morse_J/0/1/0/all/0/1.We con...
Advances in Mathematics, 213(1), pp. 183-204.We study k-Schur functions characterized by k-tableaux,...
This thesis proves a special case of the $k$-Littlewood--Richardson rule, which is analogous to the ...
AbstractWe introduce non-commutative analogs of k-Schur functions of Lapointe–Lascoux and Morse. We ...
AbstractWe obtain general identities for the product of two Schur functions in the case where one of...
AbstractWe provide a new, simple and direct combinatorial proof of the equivalence of the determinan...
We give several explicit combinatorial formulas for the expansion of k-Schur functions indexed by ma...
The understanding of the space of symmetric functions is gained through the study of its bases. Cert...
AbstractWe prove the Murnaghan–Nakayama rule for k-Schur functions of Lapointe and Morse, that is, w...
AbstractWe present several identities involving staircase Schur functions. These identities are then...
AbstractWe provide a new, simple and direct combinatorial proof of the equivalence of the determinan...
AbstractWe translate Goulden's combinatorial proof of the Jacobi-Trudi identity into the language of...
AbstractThe operator ∇ of F. Bergeron, Garsia, Haiman and Tesler [F. Bergeron, A. Garsia, M. Haiman,...
DOI
Add to ORKG