A recursion formula for k-Schur functions
Combinatorics
2007-10-01 v1
Abstract
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.
Cite
@article{arxiv.0709.4509,
title = {A recursion formula for k-Schur functions},
author = {Daniel Bravo and Luc Lapointe},
journal= {arXiv preprint arXiv:0709.4509},
year = {2007}
}
Comments
18 pages, 3 figures