Polynomials Defined by Tableaux and Linear Recurrences

  • Per Alexandersson
Keywords: Linear recurrences, Schur polynomials, Key polynomials, Demazure characters, Demazure atoms, Schubert polynomials, Grothendieck polynomials, Hall-Littlewood polynomials, Young tableaux


We show that several families of polynomials defined via fillings of diagrams satisfy linear recurrences under a natural operation on the shape of the diagram. We focus on key polynomials, (also known as Demazure characters), and Demazure atoms. The same technique can be applied to Hall-Littlewood polynomials and dual Grothendieck polynomials.

The motivation behind this is that such recurrences are strongly connected with other nice properties, such as interpretations in terms of lattice points in polytopes and divided difference operators.

Article Number