Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

// request.cf · coarse context

A page that knows where it met you.

Only coarse request metadata is shown. This demo does not display or persist visitor IP addresses.

Country
US
Cloudflare location
CMH
Connection
HTTP/2
Language
Not provided

Ray ID: a243ec7cf962fa14

Jump to content

// Workers AI · dad joke modeWhat did the LLT polynomial say? "I'm a poly to multiply

From Wikipedia, the free encyclopedia

In mathematics, an LLT polynomial is one of a family of symmetric functions introduced as q-analogues of products of Schur functions.[1]

J. Haglund, M. Haiman, and N. Loehr showed how to expand Macdonald polynomials in terms of LLT polynomials.[2] Ian Grojnowski and Mark Haiman proved a positivity conjecture for LLT polynomials that combined with the previous result implies the Macdonald positivity conjecture for Macdonald polynomials, and extended the definition of LLT polynomials to arbitrary finite root systems.[3]

References

[edit]
  1. Alain Lascoux, Bernard Leclerc, and Jean-Yves Thibon Ribbon Tableaux, Hall-Littlewood Functions, Quantum Affine Algebras and Unipotent Varieties MR 1434225 J. Math. Phys. 38 (1997), no. 2, 1041–1068.
  2. J. Haglund, M. Haiman, N. Loehr A Combinatorial Formula for Macdonald PolynomialsMR 2138143 J. Amer. Math. Soc. 18 (2005), no. 3, 735–761
  3. I. Grojnowski, M. Haiman, Affine algebras and positivity (preprint available here)

Bibliography

[edit]