相关论文: Dual equivalence graphs and a combinatorial proof …

We make a systematic study of a new combinatorial construction called a dual equivalence graph. We axiomatize these graphs and prove that their generating functions are symmetric and Schur positive. This provides a universal method for…

In 2007 Sami Assaf introduced dual equivalence graphs as a method for demonstrating that a quasisymmetric function is Schur positive. The method involves the creation of a graph whose vertices are weighted by Ira Gessel's fundamental…

Dual equivalence graphs are a powerful tool in symmetric function theory that provide a general framework for proving that a given quasisymmetric function is symmetric and Schur positive. In this paper, we study a larger family of graphs…

We prove a positive combinatorial formula for the Schur expansion of LLT polynomials indexed by a 3-tuple of skew shapes. This verifies a conjecture of Haglund. The proof requires expressing a noncommutative Schur function as a positive sum…

The purpose of this note is to introduce a new family of quasi-symmetric functions called LLT cumulants and discuss its properties. We define LLT cumulants using the algebraic framework for conditional cumulants and we prove that the…

We define dual equivalence for any collection of combinatorial objects endowed with a descent set, and we show that giving a dual equivalence establishes the symmetry and Schur positivity of the quasi-symmetric generating function. We give…

The machinery of noncommutative Schur functions provides a general tool for obtaining Schur expansions for combinatorially defined symmetric functions. We extend this approach to a wider class of symmetric functions, explore its strengths…

This paper uses the theory of dual equivalence graphs to give explicit Schur expansions for several families of symmetric functions. We begin by giving a combinatorial definition of the modified Macdonald polynomials and modified…

This paper proves an identity between flagged Schur polynomials, giving a duality between row flags and column flags. This identity generalises both the binomial determinant duality theorem due to Gessel and Viennot and the symmetric…

Let $\Lambda$ be the space of symmetric functions and $V_k$ be the subspace spanned by the modified Schur functions $\{S_\lambda[X/(1-t)]\}_{\lambda_1\leq k}$. We introduce a new family of symmetric polynomials,…

LLT polynomials are $q$-analogues of product of Schur functions that are known to be Schur-positive by Grojnowski and Haiman. However, there is no known combinatorial formula for the coefficients in the Schur expansion. Finding such a…

We introduce a shifted analogue of the ribbon tableaux defined by James and Kerber. For any positive integer $k$, we give a bijection between the $k$-ribbon fillings of a shifted shape and regular fillings of a $\lfloor k/2\rfloor$-tuple of…

In work with A. Yong, the author introduced genomic tableaux to prove the first positive combinatorial rule for the Littlewood-Richardson coefficients in torus-equivariant $K$-theory of Grassmannians. We then studied the genomic Schur…

In this paper we introduce doubly symmetric functions, arising from the equivalence of particular linear combinations of Schur functions and hook Schur functions. We study algebraic and combinatorial aspects of doubly symmetric functions,…

We prove that the combinatorial side of the "Rational Shuffle Conjecture" provides a Schur-positive symmetric polynomial. Furthermore, we prove that the contribution of a given rational Dyck path can be computed as a certain skew LLT…

We give an explicit combinatorial formula for the Schur expansion of Macdonald polynomials indexed by partitions with second part at most two. This gives a uniform formula for both hook and two column partitions. The proof comes as a…

A graph is Schur-positive if its chromatic symmetric function expands nonnegatively in the Schur basis. All claw-free graphs are conjectured to be Schur-positive. We introduce a combinatorial object corresponding to a graph G, called a…

The k-Schur functions were first introduced by Lapointe, Lascoux and Morse (2003) in the hopes of refining the expansion of Macdonald polynomials into Schur functions. Recently, an alternative definition for k-Schur functions was given by…

We attempt to explain the ubiquity of tableaux and of Pieri and Cauchy formulae for combinatorially defined families of symmetric functions. We show that such formulae are to be expected from symmetric functions arising from representations…

We prove a general inclusion-exclusion relation for the extended chromatic symmetric function of a weighted graph, which specializes to (extended) $k$-deletion, and we give two methods to obtain numerous new bases from weighted graphs for…