Polynomials defined by tableaux and linear recurrences (Q259182)

From MaRDI portal





scientific article
Language Label Description Also known as
default for all languages
No label defined
    English
    Polynomials defined by tableaux and linear recurrences
    scientific article

      Statements

      Polynomials defined by tableaux and linear recurrences (English)
      0 references
      0 references
      11 March 2016
      0 references
      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.
      0 references
      linear recurrences
      0 references
      Schur polynomials
      0 references
      key polynomials
      0 references
      Demazure characters
      0 references
      Demazure atoms
      0 references
      Schubert polynomials
      0 references
      Grothendieck polynomials
      0 references
      Hall-Littlewood polynomials
      0 references
      Young tableaux
      0 references

      Identifiers