betaFeedback

WorksMathematics

The ee-expansion of integral form Macdonald polynomials

Abstract

In this paper, we investigate the expansion of the integral form Macdonald polynomials Jμ(x;q,t)J_μ(x;q,t) in the elementary symmetric function basis. Motivated by the connection between chromatic symmetric functions and LLT polynomials, we conjecture the ee-positivity of a normalization of Jμ(x;q,t)J_μ(x;q,t). We verify the conjecture when μμ is either a hook or a two-column partition. In the hook case, we express the ee-coefficients as weighted sums over compositions. In the two-column case, we derive explicit formulas for the ee-coefficients.

Introduction

Macdonald polynomials Pμ(x;q,t)P_\mu(x;q,t) are a family of symmetric functions introduced by Macdonald in 1988 [14, 15]. Macdonald polynomials generalize many well-known bases of symmetric functions, including Schur functions and Hall–Littlewood polynomials. Moreover, due to their deep connections with various areas such as special function theory, representation theory, algebraic geometry, and quantum mechanics, they have been the subject of extensive study since their introduction. In the same work, Macdonald also defined the integral form Macdonald polynomials Jμ(x;q,t)J_\mu(x;q,t) with coefficients in Z[q,t]\mathbb{Z}[q,t]:

Jμ(x;q,t)=Pμ(x;q,t)∏c∈μ(1−qarm⁡(c)tleg⁡(c)+1).(1)J_\mu(x;q,t)=P_\mu(x;q,t)\prod_{c\in\mu}(1-q^{\operatorname{arm}(c)}t^{\operatorname{leg}(c)+1}). \tag*{(1)}

See § 2 for the precise definitions.

In 2005, Haglund, Haiman, and Loehr [8] made a major breakthrough in Macdonald theory by discovering a combinatorial formula for the modified Macdonald polynomials H~μ(x;q,t)\widetilde{H}_\mu(x;q,t), defined by

H~μ(x;q,t)=tn(μ)Jμ[X1−1/t;q,1/t],(2)\widetilde{H}_\mu(x;q,t)=t^{n(\mu)}J_\mu\left[\frac{X}{1-1/t};q,1/t\right], \tag*{(2)}

where X=x1+x2+⋯X=x_1+x_2+\cdots, the square brackets indicate plethystic substitution, and n(μ)=∑i≥1(i−1)μin(\mu)=\sum_{i\geq1}(i-1)\mu_i. Haiman [11] proved that H~μ(x;q,t)\widetilde{H}_\mu(x;q,t) is Schur positive, i.e., its Schur coefficients belong to Z≥0[q,t]\mathbb{Z}_{\geq0}[q,t].

In [8], Haglund, Haiman, and Loehr expressed H~μ(x;q,t)\widetilde{H}_\mu(x;q,t) as a positive linear combination of LLT polynomials. Introduced by Lascoux, Leclerc, and Thibon [13], the LLT polynomials LLT⁡ν(x;q)\operatorname{LLT}_\nu(x;q) are symmetric functions that are known to be Schur positive [6]. In general, LLT polynomials are indexed by tuples of skew shapes. The special case in which each skew shape consists of a single cell gives rise to the so-called unicellular LLT polynomials, which can also be indexed by Dyck paths.

The unicellular LLT polynomials are closely related to the chromatic symmetric functions χγ(x;q)\chi_\gamma(x;q) introduced in [17] when γ\gamma is a Dyck path of length 2n2n corresponding to the incomparability graph of a natural unit interval order. More precisely, Haglund and Wilson [10 Eq. (6)]

2020 Mathematics Subject Classification. Primary: 05E05; Secondary: 05A30, 33D15.

Key words and phrases. integral form Macdonald polynomials, ee-positivity, chromatic symmetric functions.

The second author was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government RS-2025-00557835. The third author was supported by the National Research Foundation of Korea (NRF) grant funded by the Ministry of Education (RS-2026-25469155). The fourth author was supported by funding for the academic research program of Chungbuk National University in 2026 and NRF grant RS-2024-00344076. observed that the result of Carlsson and Mellit [3 Proposition 3.5] is equivalent to

χγ(x;q)=LLT⁡γ[(q−1)X;q](q−1)n.(3)\chi_\gamma(x;q)=\frac{\operatorname{LLT}_\gamma[(q-1)X;q]}{(q-1)^n}. \tag*{(3)}

The chromatic symmetric functions χγ(x;q)\chi_\gamma(x;q) have been shown to expand positively in the elementary symmetric function basis (a property we refer to as e-positivity henceforth) when q=1q=1 [12, 5], and were conjectured by Shareshian and Wachs [17] to have e-coefficients in $\mathbb{Z}_{\geq 0}[q]`.1

We note that (2) is equivalent to

Jμ(x;q,t−1)=t−∑i≥1iμiH~μ[(t−1)X;q,t].(4)J_\mu(x;q,t^{-1})=t^{-\sum_{i\geq1}i\mu_i}\widetilde{H}_\mu[(t-1)X;q,t]. \tag*{(4)}

The present work is motivated by the analogy between (3) and (4). On the right-hand sides, the unicellular LLT polynomials LLT⁡γ(x;q)\operatorname{LLT}_\gamma(x;q) and the modified Macdonald polynomials H~μ(x;q,t)\widetilde{H}_\mu(x;q,t) are both Schur positive. In view of this, the conjectured e-positivity of χγ(x;q)\chi_\gamma(x;q) motivates the investigation of e-positivity for suitably normalized specializations of integral form Macdonald polynomials Jμ(x;q,t−1)J_\mu(x;q,t^{-1}).

With regard to Schur positivity, Haglund conjectured (see [1 Eq. (1)]) that, for every partition μ\mu and every positive integer kk, the symmetric function

Jμ(x;q,qk)(1−q)∣μ∣\frac{J_\mu(x;q,q^k)}{(1-q)^{|\mu|}}

has Schur coefficients in Z≥0[q]\mathbb{Z}_{\geq0}[q]. Several special cases have been proved in [2, 21, 22]. Furthermore, Wilson [20] conjectured that, for every negative integer kk, the expression obtained by replacing (1−q)(1-q) with (q−1)(q-1) and multiplying by a suitable power of qq is also Schur positive.

Building on this conjecture and the preceding discussion of the e-positivity of Jμ(x;q,t−1)J_\mu(x;q,t^{-1}) under an appropriate normalization, we propose the following conjecture.

Conjecture 1.1. For any partition μ\mu and any positive integer kk, the following is e-positive:

qk∑i≥1iμiJμ(x;q,q−k)(q−1)∣μ∣.(5)q^{k\sum_{i\geq1}i\mu_i}\frac{J_\mu(x;q,q^{-k})}{(q-1)^{|\mu|}}. \tag*{(5)}

In this paper, we prove this conjecture when μ\mu is either a hook or a two-column partition. To do this, we first consider the e-expansion of the integral form Macdonald polynomial:

Jμ(x;q,t)=∑λ⊢∣μ∣cμ,λ(q,t)eλ.J_\mu(x;q,t)=\sum_{\lambda\vdash|\mu|}c_{\mu,\lambda}(q,t)e_\lambda.

When μ\mu is a hook, we express the coefficients cμ,λ(q,t)=cμ,λc_{\mu,\lambda}(q,t)=c_{\mu,\lambda} as weighted sums over compositions (Theorem 4.2). As a consequence, we obtain a positive e-expansion of (5) (Corollary 4.6). When μ\mu has at most two columns, we compute the coefficients explicitly as products (Theorem 5.1), which implies the e-positivity of (5). In addition, for an arbitrary partition μ\mu of nn, we give a product formula for the coefficient cμ,(n)c_{\mu,(n)} of ene_n (Theorem 6.1).

The rest of the paper is organized as follows. In Section 2 we recall basic definitions and known results. In Section 3 we give an e-expansion formula for Jμ(x;q,t)J_\mu(x;q,t) when μ\mu is a one-row partition. In Section 4 we extend this result to hooks and prove Conjecture 1.1 in this case. Section 5 treats the two-column case, and Section 6 the e-coefficient. Finally, in Section 7, we explain a connection to α\alpha-chromatic symmetric functions and propose a conjecture on the q→1q\to1 limit of (5).

Declaration on Generative AI

The ChatGPT 5.5, 5.6, and 6 Pro models and Claude Opus 4.7 were used for the following tasks:

  • Simplifying the authors’ original combinatorial proof of Theorem 4.2 in Section 3.1.

  • Finding a new recursive proof of Theorem 4.2 in Section 3.2.

  • Finding and proving Proposition 4.5 and Corollary 4.6.

  • Proving Theorem 6.1.

  • Proofreading the manuscript and conducting computational experiments with Sage.

All proofs obtained with the assistance of these AI tools have been independently verified and rewritten by the authors.

Preliminaries

In this section, we introduce the basic definitions and known results that will be used throughout the paper.

Basic definitions

A composition of nn is a sequence α=(α1,α2,…,αℓ)\alpha=(\alpha_1,\alpha_2,\ldots,\alpha_\ell) of positive integers satisfying ∑iαi=n\sum_i\alpha_i=n, denoted by α⊨n\alpha\vDash n. Each αi\alpha_i is called a part of α\alpha, and the number of parts is called the length of α\alpha, denoted by ℓ(α)\ell(\alpha). The sum of the parts of α\alpha, denoted by ∣α∣|\alpha|, is called the size of α\alpha. A partition is a composition such that the parts are weakly decreasing. If ∑iλi=n\sum_i\lambda_i=n, we say that λ\lambda is a partition of nn and write λ⊢n\lambda\vdash n. For notational convenience, we also write (0)(0) for the empty partition ∅\varnothing.

If a composition α\alpha is equal to a rearrangement of a partition λ\lambda, we write α∼λ\alpha\sim\lambda. For partitions λ,μ⊢n\lambda,\mu\vdash n, we define the dominance order by μ≤λ\mu\leq\lambda if

μ1+⋯+μi≤λ1+⋯+λifor all i≥1.\mu_1+\cdots+\mu_i\leq\lambda_1+\cdots+\lambda_i \qquad\text{for all } i\geq1.

where both partitions are extended by zeros. We also write (0)(0) for the empty composition ∅\varnothing.

Given a partition λ=(λ1,…,λk)\lambda=(\lambda_1,\ldots,\lambda_k), its diagram is an array of unit squares, called cells, with λi\lambda_i cells in the iith row from the bottom, left-justified. We often identify λ\lambda with its diagram. A cell in row ii and column jj is denoted by (i,j)(i,j). The conjugate λ′\lambda^{\prime} of λ\lambda is the partition whose diagram is obtained from λ\lambda by reflecting across the diagonal y=xy=x. The reading order of λ\lambda is the order of its cells obtained by reading the rows from top to bottom and the cells in each row from left to right.

A partition of the form (r,1s)(r,1^s) with r≥1r\geq1 and s≥0s\geq0 is called a hook. Here, aba^b means the sequence of bb aa's. Note that hooks include one-row partitions (n)(n) and one-column partitions (1n)=(1,1n−1)(1^n)=(1,1^{n-1}).

Given a cell c∈λc\in\lambda, the arm (resp. coarm) length of c=(i,j)c=(i,j) is the number of cells in row ii to the right (resp. left) of cc in λ\lambda, denoted by arm⁡(c)\operatorname{arm}(c) (resp. arm⁡′(c)\operatorname{arm}^{\prime}(c)). The leg (resp. coleg) length of c=(i,j)c=(i,j) is the number of cells in column jj strictly above (resp. below) cc in λ\lambda, denoted by leg⁡(c)\operatorname{leg}(c) (resp. leg⁡′(c)\operatorname{leg}^{\prime}(c)). See Figure 1 for an example.

Image not extracted

Figure 1. For the cell c=(2,4)c=(2,4) in λ=(9,8,6,6,3)\lambda=(9,8,6,6,3), the arm, coarm, leg, and coleg lengths are arm⁡(c)=4\operatorname{arm}(c)=4, arm⁡′(c)=3\operatorname{arm}^{\prime}(c)=3, leg⁡(c)=2\operatorname{leg}(c)=2 and leg⁡′(c)=1\operatorname{leg}^{\prime}(c)=1, respectively.

For a partition λ\lambda, a semistandard Young tableau of shape λ\lambda is a filling of λ\lambda with positive integers such that the entries are weakly increasing from left to right in each row and strictly increasing from bottom to top in each column. We use SSYT⁡(λ)\operatorname{SSYT}(\lambda) to denote the set of semistandard Young tableaux of shape λ\lambda.

For a nonnegative integer rr and a partition μ\mu, we use the qq-Pochhammer symbols

(a;q)r=∏i=0r−1(1−aqi),(a;q)μ=∏i=1ℓ(μ)(a;q)μi.(a;q)_r=\prod_{i=0}^{r-1}(1-aq^i), \qquad(a;q)_\mu=\prod_{i=1}^{\ell(\mu)}(a;q)_{\mu_i}.

where (a;q)0=1(a;q)_0=1. For integers n,kn,k with 0≤k≤n0\leq k\leq n, the qq-binomial coefficient is defined by

[nk]q=(q;q)n(q;q)k(q;q)n−k.\left[\begin{matrix} n \\ k \end{matrix}\right]_q = \frac{(q;q)_n}{(q;q)_k(q;q)_{n-k}}.

We also define

References

  1. [1]P. Alexandersson, J. Haglund, and G. Wang. Some conjectures on the Schur expansion of Jack polynomials. J. Comb., 12(2):215–233, 2021.arxiv.org/abs/1810.12763
  2. [2]A. Bhattacharya. Haglund’s positivity conjecture for multiplicity one pairs. Sém. Lothar. Combin., 87:Art. B87b, 20. [2022–2023].arxiv.org/abs/2205.11802
  3. [3]E. Carlsson and A. Mellit. A proof of the shuffle conjecture. J. Amer. Math. Soc., 31(3):661–697, 2018.arxiv.org/abs/1508.06239
  4. [4]G. Gasper and M. Rahman. Basic hypergeometric series, volume 96 of Encyclopedia of Mathematics and its applications. Cambridge University Press, Cambridge, second edition, 2004. With a foreword by Richard Askey.
  5. [5]S. T. Griffin, A. Mellit, M. Romero, K. Weigl, and J. J. Wen. On Macdonald expansions of q-chromatic symmetric functions and the Stanley–Stembridge conjecture. Preprint, arXiv:2504.06936, 2025.arxiv.org/abs/2504.06936
  6. [6]I. Grojnowski and M. Haiman. Affine Hecke algebras and positivity of LLT and Macdonald polynomials. preprint, 2007. https://math.berkeley.edu/~mhaiman/ftp/llt-positivity/new-version.pdf.
  7. [7]J. Haglund. The q,t-Catalan numbers and the space of diagonal harmonics, volume 41 of University Lecture Series. American Mathematical Society, Providence, RI, 2008. With an appendix on the combinatorics of Macdonald polynomials.
  8. [8]J. Haglund, M. Haiman, and N. Loehr. A combinatorial formula for Macdonald polynomials. J. Amer. Math. Soc., 18(3):735–761, 2005.DOI
  9. [9]J. Haglund, J. Oh, and M. Yoo. α-chromatic symmetric functions. Int. Math. Res. Not. IMRN, (11):Paper No. rnaf144, 28, 2025.
  10. [10]J. Haglund and A. T. Wilson. Macdonald polynomials and chromatic quasisymmetric functions. Electron. J. Combin., 27(3):Paper No. 3.37, 21, 2020.arxiv.org/abs/1701.05622
  11. [11]M. Haiman. Hilbert schemes, polygraphs and the Macdonald positivity conjecture. J. Amer. Math. Soc., 14(4):941–1006, 2001.
  12. [12]T. Hikita. A proof of the Stanley–Stembridge conjecture. J. Amer. Math. Soc., 2026. Early View, doi:10.1090/jams/1090.DOI
  13. [13]A. Lascoux, B. Leclerc, and J.-Y. Thibon. Ribbon tableaux, Hall-Littlewood functions, quantum affine algebras, and unipotent varieties. J. Math. Phys., 38(2):1041–1068, 1997.arxiv.org/abs/q-alg/9512031
  14. [14]I. G. Macdonald. A new class of symmetric functions. Sémin. Lothar. Comb., 20:B20a, 41, 1988.
  15. [15]I. G. Macdonald. Symmetric functions and Hall polynomials. Oxford Mathematical Monographs. The Clarendon Press Oxford University Press, New York, second edition, 1995.DOI
  16. [16]OpenAI. Elementary positivity of chromatic quasisymmetric functions. preprint, 2026. https://github.com/openai/math/blob/main/preprints/Elementary-Positivity-of-Chromatic-Quasisymmetric-Functions-September-24-2026/paper.pdf.hub.valency.io/works/W_y4perpsr
  17. [17]J. Shareshian and M. L. Wachs. Chromatic quasisymmetric functions. Adv. Math., 295:497–551, 2016.arxiv.org/abs/1405.4629
  18. [18]R. P. Stanley. A symmetric function generalization of the chromatic polynomial of a graph. Adv. Math., 111(1):166–194, 1995.DOI
  19. [19]R. P. Stanley. Enumerative Combinatorics. Vol. 1, second ed. Cambridge University Press, New York/Cambridge, 2011.
  20. [20]A. Wilson. Private communication, 2017.
  21. [21]M. Yoo. A combinatorial formula for the Schur coefficients of the integral form of the Macdonald polynomials in the two column and certain hook cases. Ann. Comb., 16(2):389–410, 2012.DOI
  22. [22]M. Yoo. Schur coefficients of the integral form Macdonald polynomials. Tokyo J. Math., 38(1):153–173, 2015.DOI

Paper details

vlnc:W_x4qqcmqb
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 7

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

ChatGPT 5.5, Claude Opus 4.7 (bare)

View statement
Looking for related papers…
Contents