arXiv Analytics

Sign in

arXiv:0709.4509 [math.CO]AbstractReferencesReviewsResources

A recursion formula for k-Schur functions

Daniel Bravo, Luc Lapointe

Published 2007-09-27Version 1

The Bernstein operators allow 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.

Related articles: Most relevant | Search more
arXiv:1305.2438 [math.CO] (Published 2013-05-10)
Charge on tableaux and the poset of k-shapes
arXiv:1201.2128 [math.CO] (Published 2012-01-10)
Affine dual equivalence and k-Schur functions
arXiv:1109.1346 [math.CO] (Published 2011-09-07)
Codes and shifted codes