What makes a D₀ graph Schur positive?

DOI10.1007/S10801-016-0685-7MaRDI QIDQ345152zbMATH OpenOpenAlexFDO

Authors 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)

Abstract: We define a D_0 graph to be a graph whose vertex set is a subset of permutations of n, with edges of the form ...bac... <--> ...bca... or ...acb... <--> ...cab... (Knuth transformations), or ...bac... <--> ...acb... or ...bca... <--> ...cab... (rotation transformations), such that whenever the Knuth and rotation transformations at positions i-1, i, i+1 are available at a vertex, exactly one of these is an edge. The generating function of such a graph is the sum of the quasisymmetric functions associated to the descent sets of its vertices. Assaf studied D_0 graphs in the paper *Dual equivalence and Schur positivity* and showed that they provide a rich source of examples of the D graphs defined in the paper *Dual equivalence graphs and a combinatorial proof of LLT and Macdonald positivity*. A key construction of Assaf expresses the coefficient of q^t in an LLT polynomial as the generating function of a certain D_0 graph. LLT polynomials are known to be Schur positive by work of Grojnowski-Haiman, and experimentation shows that many D_0 graphs have Schur positive generating functions, which suggests a vast generalization of LLT positivity in this setting. As part of a series of papers, we study D_0 graphs using the Fomin-Greene theory of noncommutative Schur functions. We construct a D_0 graph whose generating function is not Schur positive by solving a linear program related to a certain noncommutative Schur function. We go on to construct a D graph on the same vertex set as this D_0 graph.

Recommendations

• Dual equivalence graphs revisited with applications to LLT and MacDonald polynomials
• 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
• LLT cumulants and graph coloring
• LLT polynomials, chromatic quasisymmetric functions and graphs with cycles

Cites work

• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 1268810 (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
• Algorithm 457: finding all cliques of an undirected graph
• Haglund's conjecture on 3-column Macdonald polynomials
• Littlewood-Richardson coefficients and Kazhdan-Lusztig polynomials.
• Noncommutative Schur functions and their applications
• Noncommutative Schur functions, switchboards, and Schur positivity
• Ribbon Schur operators
• Ribbon tableaux, Hall–Littlewood functions, quantum affine algebras, and unipotent varieties
• Shifted dual equivalence and Schur \(P\)-positivity
• The Magma algebra system. I: The user language
• The forgotten monoid

Cited in

(4)

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

Describes a project that uses

Uses Software

• Algorithm 457
• Magma

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

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