English
Related papers

Related papers: Haglund's conjecture on 3-column Macdonald polynom…

200 papers

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…

Combinatorics · Mathematics 2018-07-12 Seung Jin Lee

We provide new approaches to prove identities for the modified Macdonald polynomials via their LLT expansions. As an application, we prove a conjecture of Haglund concerning the multi-$t$-Macdonald polynomials of two rows.

Combinatorics · Mathematics 2023-02-15 Seung Jin Lee , Jaeseong Oh , Brendon Rhoades

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…

Combinatorics · Mathematics 2017-03-23 Sami Assaf

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. By constructing a graph on ribbon…

Combinatorics · Mathematics 2013-10-24 Sami H. Assaf

We prove a combinatorial formula for Macdonald cumulants which generalizes the celebrated formula of Haglund for Macdonald polynomials. We provide several applications of our formula. Firstly, it gives a new, constructive proof of a strong…

Combinatorics · Mathematics 2018-09-28 Maciej Dołęga

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…

Combinatorics · Mathematics 2016-03-15 Eugene Gorsky , Mikhail Mazin

For a partition $\nu$, let $\lambda,\mu\subseteq \nu$ be two distinct partitions such that $|\nu/\lambda|=|\nu/\mu|=1$. Butler conjectured that the divided difference…

Combinatorics · Mathematics 2026-02-09 Donghyun Kim , Seung Jin Lee , Jaeseong Oh

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…

Combinatorics · Mathematics 2022-10-07 Maciej Dołęga , Maciej Kowalski

We extend the family non-symmetric Macdonald polynomials and define general-basement Macdonald polynomials. We show that these also satisfy a triangularity property with respect to the monomials bases and behave well under the…

Combinatorics · Mathematics 2020-03-04 Per Alexandersson

We prove a combinatorial formula for the Macdonald polynomial H_mu(x;q,t) which had been conjectured by the first author. Corollaries to our main theorem include the expansion of H_mu(x;q,t) in terms of LLT polynomials, a new proof of the…

Combinatorics · Mathematics 2009-11-10 J. Haglund , M. Haiman , N. Loehr

In this paper we use the combinatorics of alcove walks to give a uniform combinatorial formula for Macdonald polynomials for all Lie types. These formulas are generalizations of the formulas of Haglund-Haiman-Loehr for Macdonald polynoimals…

Combinatorics · Mathematics 2008-03-10 Arun Ram , Martha Yip

In recent years, Alexandersson and others proved combinatorial formulas for the Schur function expansion of the horizontal-strip LLT polynomial $G_\lambda(x;q)$ in some special cases. We associate a weighted graph $\Pi$ to $\lambda$ and we…

Combinatorics · Mathematics 2020-11-30 Foster Tom

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…

Combinatorics · Mathematics 2016-07-12 Jonah Blasiak , Sergey Fomin

We give an explicit raising operator formula for the modified Macdonald polynomials $\tilde{H}_{\mu }(X;q,t)$, which follows from our recent formula for $\nabla$ on an LLT polynomial and the Haglund-Haiman-Loehr formula expressing modified…

Combinatorics · Mathematics 2023-07-14 Jonah Blasiak , Mark Haiman , Jennifer Morse , Anna Pun , George Seelinger

We introduce the Macdonald piece polynomial $\operatorname{I}_{\mu,\lambda,k}[X;q,t]$, which is a vast generalization of the Macdonald intersection polynomial in the science fiction conjecture by Bergeron and Garsia. We demonstrate a…

Combinatorics · Mathematics 2024-09-04 Donghyun Kim , Jaeseong Oh

We introduce a conjectural construction for an extension to superspace of the Macdonald polynomials. The construction, which depends on certain orthogonality and triangularity relations, is tested for high degrees. We conjecture a simple…

Mathematical Physics · Physics 2012-08-14 O. Blondeau-Fournier , P. Desrosiers , L. Lapointe , P. Mathieu

We study multiplication of any Schubert polynomial $\mathfrak{S}_w$ by a Schur polynomial $s_\lambda$ (the Schubert polynomial of a Grassmannian permutation) and the expansion of this product in the ring of Schubert polynomials. We derive…

Combinatorics · Mathematics 2014-01-03 Karola Meszaros , Greta Panova , Alexander Postnikov

We give a combinatorial proof of the factorization formula of modified Macdonald polynomials when the parameter t is specialized at a primitive root of unity. Our proof is restricted to the special case of partitions with 2 columns. We…

Combinatorics · Mathematics 2008-03-18 Francois Descouens , Hideaki Morita , Yasuhide Numata

Using the combinatorial formula for the transformed Macdonald polynomials of Haglund, Haiman, and Loehr, we investigate the combinatorics of the symmetry relation $\widetilde{H}_\mu(\mathbf{x};q,t) =…

Combinatorics · Mathematics 2015-05-27 Maria Monks Gillespie

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,…

Quantum Algebra · Mathematics 2007-05-23 L. Lapointe , A. Lascoux , J. Morse
‹ Prev 1 2 3 10 Next ›