Polynomials defined by tableaux and linear recurrences

MaRDI QIDQ259182zbMATH OpenFDO

Authors 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, http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i1p47

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

zbMATH Keywords

Demazure atomsDemazure charactersGrothendieck polynomialsHall-Littlewood polynomialskey polynomialslinear recurrencesSchubert polynomialsSchur polynomialsYoung tableaux

Mathematics Subject Classification ID

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

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.

Review text

Summary: 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 \textit{key polynomials}, (also known as Demazure characters), and \textit{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.

Recommendations

• Semistandard tableaux for Demazure characters (key polynomials) and their atoms
• Stretched skew Schur polynomials are recurrent
• An explicit construction of type A Demazure atoms
• Key polynomials and a flagged Littlewood-Richardson rule

Cites work

• A Littlewood-Richardson rule for the \(K\)-theory of Grassmannians.
• An explicit construction of type A Demazure atoms
• Combinatorial Hopf Algebras and K-Homology of Grassmanians
• Enumerative combinatorics. Volume 2.
• Flagged Schur functions, Schubert polynomials, and symmetrizing operators
• scientific article; zbMATH DE number 15435 (Why is no real title available?)
• scientific article; zbMATH DE number 3575861 (Why is no real title available?)
• scientific article; zbMATH DE number 3582368 (Why is no real title available?)
• scientific article; zbMATH DE number 739282 (Why is no real title available?)
• Key polynomials and a flagged Littlewood-Richardson rule
• Quasisymmetric Schur functions
• Schur polynomials, banded Toeplitz matrices and widom's formula
• Stretched skew Schur polynomials are recurrent

Cited in

(8)

• Polynomial table algebras and their covering numbers
• Linear recursions for integer point transforms
• Linear recurrence relations in \(q\)-systems via lattice points in polyhedra
• Noncommutative LR coefficients and crystal reflection operators
• Inhomogeneous basis set of symmetric polynomials defined by tableaux.
• scientific article; zbMATH DE number 14020 (Why is no real title available?)
• scientific article; zbMATH DE number 1525365 (Why is no real title available?)
• Linear recurrences for cylindrical networks

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)