What makes a \(\mathbf D_0\) graph Schur positive?

DOI10.1007/S10801-016-0685-7zbMath1358.05302arXiv1411.3624OpenAlexW2397733484MaRDI QIDQ345152

Jonah Blasiak

Publication date: 25 November 2016

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

linear programmingLLT polynomialsnoncommutative Schur functions\(D\) graphsdual equivalence graphsKnuth transformations

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05) Graph theory (05C99)

Related Items (4)

Variants of the RSK algorithm adapted to combinatorial Macdonald polynomials ⋮ Noncommutative Schur functions, switchboards, and Schur positivity ⋮ Robinson-Schensted correspondence for unit interval orders ⋮ Kronecker coefficients and noncommutative super Schur functions

Uses Software

• Algorithm 457
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Haglund's conjecture on 3-column Macdonald polynomials
• Noncommutative Schur functions, switchboards, and Schur positivity
• Shifted dual equivalence and Schur \(P\)-positivity
• The Magma algebra system. I: The user language
• Noncommutative Schur functions and their applications
• A combinatorial formula for the character of the diagonal coinvariants
• Ribbon Schur operators
• The forgotten monoid
• Ribbon tableaux, Hall–Littlewood functions, quantum affine algebras, and unipotent varieties
• A combinatorial formula for Macdonald polynomials
• A combinatorial model for the Macdonald polynomials
• Algorithm 457: finding all cliques of an undirected graph

This page was built for publication: What makes a \(\mathbf D_0\) graph Schur positive?