Polynomials defined by tableaux and linear recurrences

zbMath1333.05313arXiv1505.02717MaRDI QIDQ259182

Per Alexandersson

Publication date: 11 March 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.02717

zbMATH Keywords

linear recurrencesYoung tableauxSchubert polynomialsSchur polynomialsDemazure atomsDemazure charactersGrothendieck polynomialsHall-Littlewood polynomialskey polynomials

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10)

Related Items (4)

Noncommutative LR coefficients and crystal reflection operators ⋮ Linear recurrence relations in \(q\)-systems via lattice points in polyhedra ⋮ Linear Recurrences for Cylindrical Networks ⋮ Linear recursions for integer point transforms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quasisymmetric Schur functions
• An explicit construction of type A Demazure atoms
• Flagged Schur functions, Schubert polynomials, and symmetrizing operators
• Key polynomials and a flagged Littlewood-Richardson rule
• A Littlewood-Richardson rule for the \(K\)-theory of Grassmannians.
• Schur polynomials, banded Toeplitz matrices and widom's formula
• Stretched skew Schur polynomials are recurrent
• Combinatorial Hopf Algebras and K-Homology of Grassmanians

This page was built for publication: Polynomials defined by tableaux and linear recurrences