English
Related papers

Related papers: Macdonald cumulants, $G$-inversion polynomials and…

200 papers

We give a combinatorial formula for LLT cumulants of unicellular unilevelled shapes in terms of parking functions and Cayley trees. Our formula implies previously conjectured Schur positivity.

Combinatorics · Mathematics 2020-12-03 Maciej Kowalski

This paper contains the proof of Macdonald's duality and evaluation conjectures, the definition of the difference Fourier transform, the recurrence theorem generalizing Pieri rules, and the action of GL(2,Z) on the Macdonald polynomials at…

q-alg · Mathematics 2009-10-28 Ivan Cherednik

Haglund's conjecture states that $\dfrac{\langle J_{\lambda}(q,q^k),s_\mu \rangle}{(1-q)^{|\lambda|}} \in \mathbb{Z}_{\geq 0}[q]$ for all partitions $\lambda,\mu$ and all non-negative integers $k$, where $J_{\lambda}$ is the integral form…

Combinatorics · Mathematics 2022-06-10 Aritra Bhattacharya

Multiple analogues of certain families of combinatorial numbers are recently constructed by the author in terms of well poised Macdonald functions, and some of their fundamental properties are developed. In this paper, we present…

Combinatorics · Mathematics 2016-01-05 Hasan Coskun

A breakthrough in the theory of (type A) Macdonald polynomials is due to Haglund, Haiman and Loehr, who exhibited a combinatorial formula for these polynomials in terms of fillings of Young diagrams. Recently, Ram and Yip gave a formula for…

Combinatorics · Mathematics 2008-11-26 Cristian Lenart

Macdonald polynomials are orthogonal polynomials associated to root systems, and in the type A case, the symmetric kind is a common generalization of Schur functions, Macdonald spherical functions, and Jack polynomials. We use the…

Combinatorics · Mathematics 2010-10-06 Martha Yip

We give an elementary proof of the development of Macdonald polynomials in terms of "modified complete" and elementary symmetric functions.

Combinatorics · Mathematics 2007-05-23 Michel Lassalle

In 1996, Knop and Sahi introduced a remarkable family of inhomogeneous symmetric polynomials, defined via vanishing conditions, whose top homogeneous parts are exactly the Macdonald polynomials. Like the Macdonald polynomials, these…

Combinatorics · Mathematics 2025-10-24 Houcine Ben Dali , Lauren Williams

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

A remarkable feature of Schur functions -- the common eigenfunctions of cut-and-join operators from $W_\infty$ -- is that they factorize at the peculiar two-parametric topological locus in the space of time-variables, what is known as the…

High Energy Physics - Theory · Physics 2016-09-12 Ya. Kononov , A. Morozov

The modified Macdonald polynomials introduced by Garsia and Haiman (1996) have many remarkable combinatorial properties. One such class of properties involves applying the $\nabla$ operator of Bergeron and Garsia (1999) to basic symmetric…

Combinatorics · Mathematics 2018-04-18 Emily Sergel

An overview of the basic results on Macdonald(-Koornwinder) polynomials and double affine Hecke algebras is given. We develop the theory in such a way that it naturally encompasses all known cases. Among the basic properties of the…

Quantum Algebra · Mathematics 2012-08-30 Jasper V. Stokman

We give a concise direct proof of the orthogonality of interpolation Macdonald polynomials with respect to the Fourier pairing and briefly discuss some immediate applications of this orthogonality, such as the symmetry of the Fourier…

Quantum Algebra · Mathematics 2007-05-23 Andrei Okounkov

We study the specialization of the type A nonsymmetric Macdonald polynomials at $t=0$ based on the combinatorial formula of Haglund, Haiman, and Loehr. We prove that this specialization expands nonnegatively into the fundamental slide…

Combinatorics · Mathematics 2020-03-05 Sami Assaf

We introduce a new operator $\Gamma$ on symmetric functions, which enables us to obtain a creation formula for Macdonald polynomials. This formula provides a connection between the theory of Macdonald operators initiated by Bergeron,…

Combinatorics · Mathematics 2026-05-18 Houcine Ben Dali , Michele D'Adderio

We give the explicit analytic development of Macdonald polynomials in terms of "modified complete" and elementary symmetric functions. These expansions are obtained by inverting the Pieri formula. Specialization yields similar developments…

Combinatorics · Mathematics 2019-02-22 Michel Lassalle , Michael Schlosser

A well-known and fundamental property of the Macdonald polynomials $P_\lambda(x;q,t)$ is their invariance under the transformation sending $(q,t)$ to $(q^{-1},t^{-1})$. Recently, Concha and Lapointe showed that this property extends in an…

Combinatorics · Mathematics 2025-08-29 Daniel Orr , Johnny Rivera

Singular nonsymmetric Macdonald polynomials are constructed by use of the representation theory of the Hecke algebras of the symmetric groups. These polynomials are labeled by quasistaircase partitions and are associated to special…

Representation Theory · Mathematics 2020-02-28 Laura Colmenarejo , Charles F. Dunkl

The Macdonald polynomials expanded in terms of a modified Schur function basis have coefficients called the $q,t$-Kostka polynomials. We define operators to build standard tableaux and show that they are equivalent to creation operators…

Combinatorics · Mathematics 2007-05-23 L. Lapointe , J. Morse

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