Polynomials defined by tableaux and linear recurrences

From MaRDI portal
Publication:259182

zbMATH Open1333.05313arXiv1505.02717MaRDI QIDQ259182FDOQ259182

Per Alexandersson

Publication date: 11 March 2016

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

Abstract: 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.


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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations




Cites Work


Cited In (8)





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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q259182)