alphaFeedback

WorksMathematics

Changing parameters in Hall-Littlewood functions

AI contributions
  • LLMs
  • GPT-5.6 Sol · bare
  • Kimi K3 · bare
View details

Abstract

We study the transition coefficients bλ,μ(q,t)b_{λ,μ}(q,t) of the Hall–Littlewood PP-functions Pλ(t)P_λ(t) expanded in the basis Pμ(q)P_μ(q). We find a tableaux formula when λλ is a hook shape which generalizes term-by-term Lascoux-Schutzenberger's charge formula as well as Macdonald's monomial expansion formula for Hall-Littlewood functions. We conjecture that bλ,μ(t+1,t)∈Z≥0[t]b_{λ,μ}(t+1,t)\in\mathbb{Z}_{\ge0}[t] and prove it when λλ is a hook shape, when λλ has two-columns and some more simple cases. We prove that bλ,μ(t+n,n)∈Z≥0[t]b_{λ,μ}(t+n,n)\in\mathbb{Z}_{\ge0}[t] for every n∈Z≥0n\in\mathbb{Z}_{\ge0}, extending work of Alexandersson, and we record a stability property and some reduction principles.

Introduction

The Hall–Littlewood PP-functions Pλ(u)P_\lambda(u) are a one-parameter family of symmetric functions depending on a parameter uu and indexed by integer partitions λ\lambda. These functions interpolate between two important bases of the space of symmetric functions: the Schur functions sλ=Pλ(0)s_\lambda= P_\lambda(0) and the monomial symmetric functions mλ=Pλ(1)m_\lambda= P_\lambda(1).

The transition matrix coefficients expressing the Schur functions in terms of the monomial symmetric functions are the Kostka numbers Kλ,μK_{\lambda,\mu},

sλ=∑μKλ,μmμ.(1)s_\lambda= \sum_\mu K_{\lambda,\mu}m_\mu. \tag*{(1)}

This equation is a direct shadow of the weight space decomposition of the irreducible GLn(C)GL_n(\mathbb{C}) representations (for large enough nn), and Kostka numbers are the dimensions of the weight spaces of irreducible GLn(C)GL_n(\mathbb{C})-representations. There are many combinatorial models which enumerate these Kostka numbers, one of the most popular being the semistandard Young tableaux: Kλ,μK_{\lambda,\mu} is the number of semistandard Young tableaux of shape λ\lambda and content μ\mu.

A uu-analogue of the above picture is obtained by considering the transition matrix coefficients from the Schur functions expanded in the Hall–Littlewood PP-basis; the coefficients Kλ,μ(u)K_{\lambda,\mu}(u) are called the Kostka–Foulkes polynomials.

sλ=∑μKλ,μ(u)Pμ(u).(2)s_\lambda= \sum_\mu K_{\lambda,\mu}(u)P_\mu(u). \tag*{(2)}

Under the Satake isomorphism this equation is a shadow of the change of basis between the canonical and standard bases of the spherical Hecke algebra, and the polynomials Kλ,μ(u)K_{\lambda,\mu}(u) are certain Kazhdan–Lusztig polynomials, encoding the Poincaré polynomials of certain intersection cohomology. From this standpoint Kλ,μ(u)∈Z≥0[u]K_{\lambda,\mu}(u) \in\mathbb{Z}_{\ge0}[u], polynomials with positive integral coefficients. Lascoux and Schützenberger developed a subtle statistic on semistandard Young tableaux, called charge and denoted ch⁡\operatorname{ch} in this paper, which serves to give a combinatorial interpretation of these coefficients:

Kλ,μ(u)=∑T∈SSYT⁡(λ,μ)uch⁡(T),(3)K_{\lambda,\mu}(u) = \sum_{T \in\operatorname{SSYT}(\lambda,\mu)} u^{\operatorname{ch}(T)}, \tag*{(3)}

where SSYT⁡(λ,μ)\operatorname{SSYT}(\lambda,\mu) denotes the set of semistandard Young tableaux of shape λ\lambda and content μ\mu.

In another direction, one can generalize (1) by changing the Schur function side to Hall–Littlewood PP-functions; in this case Macdonald [13] has an expansion formula by summing over semistandard Young tableaux again:

Pλ(u)=∑μ(∑T∈SSYT⁡(λ,μ)ψT(u))mμ,(4)P_{\lambda}(u) = \sum_{\mu} \left(\sum_{T \in\operatorname{SSYT}(\lambda,\mu)} \psi_T(u)\right)m_{\mu}, \tag*{(4)}

where ψT(u)∈Z[u]\psi_T(u) \in\mathbb{Z}[u] is explicitly described in § 2.8.

The transition coefficients b(q,t)b(q,t)

In view of the above it is desirable to study the transition matrix between two families of Hall–Littlewood PP-functions, parametrized by different parameters. More specifically, consider Λ=ΛQ(q,t)\Lambda= \Lambda_{\mathbb{Q}(q,t)}, the space of symmetric functions with coefficients from Q(q,t)\mathbb{Q}(q,t). The families (Pλ(t))λ∈Par⁡(P_{\lambda}(t))_{\lambda\in\operatorname{Par}} and (Pλ(q))λ∈Par⁡(P_{\lambda}(q))_{\lambda\in\operatorname{Par}} are both Q(q,t)\mathbb{Q}(q,t)-bases of Λ\Lambda, where Par⁡\operatorname{Par} denotes the set of integer partitions. We want to investigate properties of bλ,μ(q,t)b_{\lambda,\mu}(q,t) defined by

Pλ(t)=∑μ∈Par⁡bλ,μ(q,t)Pμ(q).(5)P_{\lambda}(t) = \sum_{\mu\in\operatorname{Par}} b_{\lambda,\mu}(q,t)P_{\mu}(q). \tag*{(5)}

Writing the matrices b(q,t)=(bλ,μ(q,t))λ,μ∈Par⁡b(q,t) = (b_{\lambda,\mu}(q,t))_{\lambda,\mu\in\operatorname{Par}}, K(u)=(Kλ,μ(u))λ,μ∈Par⁡K(u) = (K_{\lambda,\mu}(u))_{\lambda,\mu\in\operatorname{Par}}, we get

b(q,t)=K(t)−1K(q).(6)b(q,t) = K(t)^{-1}K(q). \tag*{(6)}

Carbonara [7] obtained a combinatorial formula for the entries of the inverse Kostka–Foulkes matrix, thus in principle we have a signed formula for bλ,μ(q,t)b_{\lambda,\mu}(q,t). By the above discussion

bλ,μ(q,0)=∑T∈SSYT⁡(λ,μ)qch⁡(T)andbλ,μ(1,t)=∑T∈SSYT⁡(λ,μ)ψT(t).(7)b_{\lambda,\mu}(q,0) = \sum_{T \in\operatorname{SSYT}(\lambda,\mu)} q^{\operatorname{ch}(T)} \qquad\text{and}\qquad b_{\lambda,\mu}(1,t) = \sum_{T \in\operatorname{SSYT}(\lambda,\mu)} \psi_T(t). \tag*{(7)}

A tableaux formula for hook shapes

It would be very interesting if one could find a formula that attaches a weight to tableaux in such a way that at t=0t = 0 and q=1q = 1 the weights specialize to the charge and Macdonald’s monomial expansion weights term-by-term, respectively. We answer this question in the positive for the case when λ\lambda is a hook shape and some more simple cases. We now describe our result for hook shape.

We defer the definition of charge to § 2.10; for now we only comment that given a tableau T∈SSYT⁡(λ,μ)T \in\operatorname{SSYT}(\lambda,\mu), for some partitions λ,μ\lambda,\mu, each cell xx in the Young diagram of λ\lambda gets assigned a weight ch⁡T(x)\operatorname{ch}_T(x) such that ch⁡(T)=∑x∈λch⁡T(x)\operatorname{ch}(T) = \sum_{x\in\lambda}\operatorname{ch}_T(x).

Suppose λ=(n−k,1k)\lambda=(n-k,1^k), n−k>1n-k>1, k≥0k\geq0. For T∈SSYT⁡(λ,μ)T\in\operatorname{SSYT}(\lambda,\mu) we define ψT(q,t)∈Z[q,t]\psi_T(q,t)\in\mathbb{Z}[q,t] below. Let

m={T(1,2)−1,if T(1,2)≠1,1,otherwise.m= \begin{cases} T(1,2)-1, & \text{if }T(1,2)\ne1,\\ 1, & \text{otherwise.} \end{cases}

Define

ψT(x;q,t)={(qch⁡T(x)−t),if coarm⁡(x)>0, and T(Left⁡(x))<T(x),qch⁡T(x),otherwise,(8)\psi_T(x;q,t)= \begin{cases} (q^{\operatorname{ch}_T(x)}-t), & \text{if }\operatorname{coarm}(x)>0,\text{ and }T(\operatorname{Left}(x))<T(x),\\ q^{\operatorname{ch}_T(x)}, & \text{otherwise,} \end{cases} \tag*{(8)}

where Left⁡(x)\operatorname{Left}(x) denotes the box immediately on the left of xx in the same row. Let

ψT(q,t)=[m]t⋅∏x∈λψT(x;q,t),(9)\psi_T(q,t)=[m]_t\cdot\prod_{x\in\lambda}\psi_T(x;q,t), \tag*{(9)}

where [m]t=1+t+⋯+tm−1[m]_t=1+t+\cdots+t^{m-1} for m∈Z>0m\in\mathbb{Z}_{>0}. Then

ψT(q,0)=qch⁡(T)\psi_T(q,0)=q^{\operatorname{ch}(T)}

and ψT(1,t)=ψT(t)\psi_T(1,t)=\psi_T(t).

For the unique tableau of shape (1n)(1^n) let ψT(q,t)=1\psi_T(q,t)=1. Then we prove the following theorem.

Theorem 1.1. For λ=(n−k,1k)\lambda=(n-k,1^k), n>k≥0n>k\geq0, and μ∈Par⁡\mu\in\operatorname{Par},

bλ,μ(q,t)=∑T∈SSYT⁡(λ,μ)ψT(q,t).(10)b_{\lambda,\mu}(q,t)=\sum_{T\in\operatorname{SSYT}(\lambda,\mu)}\psi_T(q,t). \tag*{(10)}

The proof of Theorem 1.1 is given in § 6. When λ\lambda is a single row, (10) simplifies to the following product formula (proved in Theorem 5.1):

b(n),μ(q,t)=qn(μ)−(ℓ2)∏i=1ℓ−1(qi−t),(11)b_{(n),\mu}(q,t)=q^{n(\mu)-\binom{\ell}{2}}\prod_{i=1}^{\ell-1}(q^i-t), \tag*{(11)}

where ℓ=ℓ(μ)\ell=\ell(\mu) and n(μ)=∑i≥1(i−1)μin(\mu)=\sum_{i\geq1}(i-1)\mu_i.

In the final two sections § 8 and § 9 we show that analogous formulas work when μ\mu is of the form (n,k,1)(n,k,1) and small hooks (n−2,12),(n−3,13)(n-2,1^2),(n-3,1^3).

A positivity conjecture and further results

Theorem 1.1 immediately implies that in the case that λ\lambda is of hook shape, we have bλ,μ(t+1,t)∈Z≥0[t]b_{\lambda,\mu}(t+1,t)\in\mathbb{Z}_{\geq0}[t]. We conjecture that this is true for general λ,μ\lambda,\mu, and have checked it for partitions of size at most 26 in SageMath.

Conjecture 1.2. For λ,μ∈Par⁡\lambda,\mu\in\operatorname{Par}, bλ,μ(t+1,t)∈Z≥0[t]b_{\lambda,\mu}(t+1,t)\in\mathbb{Z}_{\geq0}[t].

References

  1. [1]Per Alexandersson. LLT polynomials, elementary symmetric functions and melting lol-lipops. J. Algebr. Comb., 53(2):299–325, 2021.
  2. [2]Per Alexandersson and Robin Sulzgruber. A combinatorial expansion of vertical-strip LLT polynomials in the basis of elementary symmetric functions. Adv. Math., 400:58, 2022. Id/No 108256.DOI
  3. [3]Aritra Bhattacharya. Haglund’s positivity conjecture for multiplicity one pairs. Sémin. Lothar. Comb., 87:article b87b, 20, 2023.arxiv.org/abs/2205.11802
  4. [4]Aritra Bhattacharya. Haglund’s Conjecture and Clebsch–Gordan Rule for Macdonald Polynomials. PhD thesis, Homi Bhabha National Institute, Chennai, India, April 2024. IMSc Theses/Dissertations, HBNI Th241.
  5. [5]Aritra Bhattacharya. The monomial expansion formula for Hall-Littlewood P-polynomials, https://arxiv.org/abs/2407.14652, 2024.
  6. [7]Joaquin O. Carbonara. A combinatorial interpretation of the inverse t-Kostka matrix. volume 193, pages 117–145. 1998. Selected papers in honor of Adriano Garsia (Taormina, 1994).DOI
  7. [8]Mark Haiman. Macdonald polynomials and geometry. In New perspectives in algebraic combinatorics, pages 207–254. Cambridge: Cambridge University Press, 1999.DOI
  8. [9]Shashank Kanade, Matthew C. Russell, Shunsuke Tsuchioka, and S. Ole Warnaar. Remarks on the conjectures of Capparelli, Meurman, Primc and Primc. Preprint, arXiv:2404.03851 [math.CO] (2026), 2026.arxiv.org/abs/2404.03851
  9. [10]Alain Lascoux. Adding ±1 to the argument of a Hall-Littlewood polynomial. Sémin. Lothar. Comb., 54:b54n, 17, 2005.
  10. [11]M. Lothaire. Algebraic combinatorics on words. With preface by Jean Berstel and Dominique Perrin., volume 90 of Encycl. Math. Appl. Cambridge: Cambridge University Press, reprint of the 2002 hardback ed. edition, 2011.
  11. [12]Alain Lascoux and Marcel-Paul Schützenberger. Sur une conjecture de H. O. Foulkes. C. R. Acad. Sci., Paris, Sér. A, 286:323–324, 1978.
  12. [13]I. G. Macdonald. Symmetric functions and Hall polynomials. Oxford Mathematical Monographs. The Clarendon Press, Oxford University Press, New York, second edition, 1995. With contributions by A. Zelevinsky, Oxford Science Publications.DOI
  13. [14]Igor Makhlin. On a positivity property of Hall–Littlewood polynomials. MathOverflow. URL:https://mathoverflow.net/q/190646 (version: 2014-12-17).
  14. [15]Anton Mellit. Poincaré polynomials of character varieties, Macdonald polynomials and affine Springer fibers. Ann. Math. (2), 192(1):165–228, 2020.arxiv.org/abs/1710.04513
  15. [16]Richard P. Stanley. Enumerative combinatorics. Volume 2, volume 62 of Camb. Stud. Adv. Math. Cambridge: Cambridge University Press, 1999.
  16. [17]Michael Zabrocki. On the Action of the Hall–Littlewood Vertex Operator. PhD thesis, University of California, San Diego, 1998. Ph.D. dissertation.

Paper details

vlnc:W_m9c4dund
v1 · latestHistory (1)

published · Fresh — added to the Hub within the last 30 days

added ·

Usage

views · 0

downloads · 0

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

CC BY 4.0

Original source

  • Mathematics

LLMs, GPT-5.6 Sol (bare), Kimi K3 (bare) · View statement →

Looking for related papers…
Contents