Related Experiment Video
Updated: Aug 20, 2026

Generation and Coherent Control of Pulsed Quantum Frequency Combs
Published on: June 8, 2018
Combinatorial theory of Macdonald polynomials I: proof of Haglund's formula
1Department of Mathematics, University of Pennsylvania, Philadelphia, PA 19104-6395, USA. jhaglund@math.upenn.edu
Abstract:
Haglund recently proposed a combinatorial interpretation of the modified Macdonald polynomials H(mu). We give a combinatorial proof of this conjecture, which establishes the existence and integrality of H(mu). As corollaries, we obtain the cocharge formula of Lascoux and Schutzenberger for Hall-Littlewood polynomials, a formula of Sahi and Knop for Jack's symmetric functions, a generalization of this result to the integral Macdonald polynomials J(mu), a formula for H(mu) in terms of Lascoux-Leclerc-Thibon polynomials, and combinatorial expressions for the Kostka-Macdonald coefficients K(lambda,mu) when mu is a two-column shape.
Related Concept Videos
Fundamental Theorem of Algebra
The Binomial Theorem
Convolution Properties I
The commutative property reveals that the input and the impulse response of an LTI (Linear Time-Invariant) system can be interchanged without affecting the output:
Extended Versions of Green’s Theorem
Green’s Theorem
Routh-Hurwitz Criterion II
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first column of the Routh...