Polynomials defined by tableaux and linear recurrences
zbMATH Open1333.05313arXiv1505.02717MaRDI QIDQ259182FDOQ259182
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Demazure atomsDemazure charactersGrothendieck polynomialsHall-Littlewood polynomialskey polynomialslinear recurrencesSchubert polynomialsSchur polynomialsYoung tableaux
Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10)
Cites Work
- Key polynomials and a flagged Littlewood-Richardson rule
- Title not available (Why is that?)
- Flagged Schur functions, Schubert polynomials, and symmetrizing operators
- Title not available (Why is that?)
- An explicit construction of type A Demazure atoms
- 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
- Enumerative combinatorics. Volume 2.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combinatorial Hopf Algebras and K-Homology of Grassmanians
- Quasisymmetric Schur functions
Cited In (8)
- Linear recursions for integer point transforms
- Linear Recurrences for Cylindrical Networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Inhomogeneous basis set of symmetric polynomials defined by tableaux.
- Noncommutative LR coefficients and crystal reflection operators
- Polynomial table algebras and their covering numbers
- Linear recurrence relations in \(q\)-systems via lattice points in polyhedra
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)