A recursion formula for k-Schur functions
From MaRDI portal
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.
Recommendations
- On some factorization formulas of \(K\)-\(k\)-Schur functions
- Schubert polynomials and \(k\)-Schur functions
- The \({\mathcal S}\)-recurrence of Schur parameters of non-inner rational Schur functions
- Recurrent sequences and Schur functions
- scientific article; zbMATH DE number 3981359
- Recursive and combinatorial properties of Schubert polynomials
- scientific article; zbMATH DE number 3889534
- A Pieri formula and a factorization formula for sums of \(K\)-theoretic \(K\)-Schur functions
- A \(k\)-tableau characterization of \(k\)-Schur functions
- A formula for the Kronecker products of Schur functions of hook shapes
Cites work
- scientific article; zbMATH DE number 1618186 (Why is no real title available?)
- scientific article; zbMATH DE number 3766017 (Why is no real title available?)
- scientific article; zbMATH DE number 3771876 (Why is no real title available?)
- A \(k\)-tableau characterization of \(k\)-Schur functions
- Affine insertion and Pieri rules for the affine Grassmannian
- Cranks and t-cores
- Crystal base for the basic representation of \(U_ q({\mathfrak sl}^\wedge (n))\)
- Littlewood-Richardson without algorithmically defined bijections
- Quantum cohomology and the 𝑘-Schur basis
- Representations of finite classical groups. A Hopf algebra approach
- Schubert polynomials for the affine Grassmannian
- Schur function analogs for a filtration of the symmetric function space
- Tableau atoms and a new Macdonald positivity conjecture
- Tableaux on \(k+1\)-cores, reduced words for affine permutations, and \(k\)-Schur expansions
Cited in
(7)- Codes and shifted codes
- Bernstein operators and super-Schur functions: combinatorial aspects
- The first term in the expansion of plethysm of Schur functions
- scientific article; zbMATH DE number 3981359 (Why is no real title available?)
- A decomposition of Schur functions and an analogue of the Robinson-Schensted-Knuth algorithm
- The combinatorics of the HMZ operators applied to Schur functions
- scientific article; zbMATH DE number 7390794 (Why is no real title available?)
This page was built for publication: A recursion formula for \(k\)-Schur functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024348)