a recursion formula for k-schur functions：k-schur函数的递推公式.pdf

Journal of Combinatorial Theory, Series A 116 (2009) 918–935 Contents lists available at ScienceDirect Journal of Combinatorial Theory, Series A /locate/jcta A recursion formula for k-Schur functions Daniel Bravo a , Luc Lapointe b,1 a Department of Mathematics and Computer Science, Wesleyan University, Science Tower 655, 265 Church St., Middletown, CT 06459-0128, USA b Instituto de Matemática y Física, Universidad de Talca, Camino Lircay S/N, Campus Norte, Casilla 747, Talca, Chile a r t i c l e i n f o a b s t r a c t Article history: The Bernstein operators allow one to build recursively the Schur Received 28 September 2007 functions. We present a recursion formula for k-Schur functions at Available online 22 January 2009 t = 1 based on combinatorial operators that generalize the Bern- stein operators. The recursion leads immediately to a combinatorial Keywords: interpretation for the expansion coefficients of k-Schur functions at Symmetric functions Schur functions t = 1 in terms of homogeneous symmetric functions. Bernstein operators © 2009 Elsevier Inc. All rights reserved. k-Schur functions 1. Introduction The study of Macdonald polynomials led to the discovery of symmetric functions, s (k) (t), indexed λ by partitions whose first par