Variants of the RSK algorithm adapted to combinatorial Macdonald polynomials

DOI10.1016/J.JCTA.2016.09.002MaRDI QIDQ346440zbMATH OpenOpenAlexFDO

Authors Nicholas A. Loehr

Publication date 29 November 2016

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcta.2016.09.002

zbMATH Keywords

Schur polynomialsMacdonald polynomialspermutation statisticsRobinson-Schensted correspondenceRSK algorithm

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05) Basic orthogonal polynomials and functions associated with root systems (Macdonald polynomials, etc.) (33D52)

Recommendations

• On combinatorial formulas for MacDonald polynomials
• Recursion and explicit formulas for particular \(N\)-variable Knop-Sahi and Macdonald polynomials
• A new generalisation of Macdonald polynomials
• A combinatorial model for the Macdonald polynomials
• A new recursion in the theory of Macdonald polynomials
• An algebraic approach to the non-symmetric Macdonald polynomial
• A combinatorial formula for Macdonald polynomials
• A combinatorial formula for Macdonald polynomials
• A combinatorial formula for nonsymmetric Macdonald polynomials
• Generalized binomial coefficients and Macdonald polynomials

Cites work

• scientific article; zbMATH DE number 1601795 (Why is no real title available?)
• scientific article; zbMATH DE number 1001729 (Why is no real title available?)
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• scientific article; zbMATH DE number 739282 (Why is no real title available?)
• scientific article; zbMATH DE number 2220986 (Why is no real title available?)
• A combinatorial formula for Macdonald polynomials
• A combinatorial formula for the character of the diagonal coinvariants
• A combinatorial model for the Macdonald polynomials
• A generalized major index statistic
• A graded representation model for Macdonald's polynomials.
• A new class of symmetric functions
• Bijective combinatorics
• Dual equivalence graphs revisited and the explicit Schur expansion of a family of LLT polynomials
• Dual equivalence graphs. I: a new paradigm for Schur positivity
• Dual equivalence with applications, including a conjecture of Proctor
• Haglund's conjecture on 3-column Macdonald polynomials
• Hilbert schemes, polygraphs and the Macdonald positivity conjecture
• Permutations, matrices, and generalized Young tableaux
• Positivity for special cases of \((q,t)\)-Kostka coefficients and standard tableaux statistics
• Ribbon tableaux, Hall–Littlewood functions, quantum affine algebras, and unipotent varieties
• Some bijective correspondences involving domino tableaux
• Splitting the square of a Schur function into its symmetric and antisymmetric parts
• Statistics for Special q, t-Kostka Polynomials
• What makes a \(\mathbf D_0\) graph Schur positive?

Cited in

(4)

• Toward the Schur expansion of Macdonald polynomials
• Algorithms and codes for the Macdonald function: Recent progress and comparisons.
• \(q\text{RS}t\): a probabilistic Robinson-Schensted correspondence for Macdonald polynomials
• Abacus proofs of Schur expansions of Macdonald polynomials

This page was built for publication: Variants of the RSK algorithm adapted to combinatorial Macdonald polynomials

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