License: arXiv.org perpetual non-exclusive license
arXiv:2606.28108v1 [math.CO] 26 Jun 2026

Mixed Products of Modified Greaves–Jing–Zhu Operators

S.-J. Lee
Abstract

Let 𝒴(z;t)\mathcal{Y}(z;t) be the modified Greaves–Jing–Zhu operator on the odd power-sum ring. We first point out that this operator can be obtained from the classical neutral operator by a simple diagonal change of variables. We then study products in which the two deformation parameters are not necessarily the same. For two parameters tt and ss, we compute the scalar factor that appears in the mixed product. This factor has an explicit exponential form and, in a completed setting, can also be written as a quotient of infinite tt-Pochhammer products. We also give a recurrence for its coefficients, a product formula for several mixed operators, and formulas for the coefficients obtained after applying the operators to 𝟏\mathbf{1}.

A particularly simple case occurs when s=tMs=t^{M}. In this case the scalar factor becomes the finite quotient (u;t)M/(u;t)M(u;t)_{M}/(-u;t)_{M}. Its coefficients are signed principal specializations of one-row Schur QQ-functions. As a result, after removing the signs, these coefficients are nonnegative palindromic polynomials. We also give a Gaussian-binomial formula and a finite-order recurrence.

1 Introduction

Vertex operators provide a useful way to organize identities involving symmetric functions, Heisenberg algebras, and free-fermion representations. Greaves, Jing, and Zhu introduced a charged-fermion operator construction for the tt-Schur functions and the associated tt-Schur measure [1]. We adapted the same idea to the odd power-sum ring, which is the standard setting for Schur QQ-functions [4]. The resulting modified operator has the same scalar factor as the classical neutral operator when both operators use the same parameter. Its modes generate shifted tt-Schur functions and lead to a two-row formula, a Pfaffian Giambelli identity, a Cauchy identity, and a finite shifted Gessel formula.

The goal of this paper is more limited. We only study what happens when two modified operators with different parameters are multiplied. General linear transformations of vertex-operator presentations have been studied in a broader setting; see, for example, [6]. In the present case, the diagonal form of the modified Greaves–Jing–Zhu operator makes the mixed factor especially explicit.

Let

ρt(pn)=(1tn)pn(n1 odd).\rho_{t}(p_{n})=(1-t^{n})p_{n}\qquad(n\geq 1\text{ odd}).

Our first observation is

𝒴(z;t)=ρt(z)ρt1,𝒬λ(X;t)=Qλ[XtX],\mathcal{Y}(z;t)=\rho_{t}\Phi(z)\rho_{t}^{-1},\qquad\mathcal{Q}_{\lambda}(X;t)=Q_{\lambda}[X-tX],

where (z)\Phi(z) is the classical neutral operator. For two independent parameters, the mixed product has the form

𝒴(z;t)𝒴(w;s)=Ft,s(w/z):𝒴(z;t)𝒴(w;s):,\mathcal{Y}(z;t)\mathcal{Y}(w;s)=F_{t,s}(w/z):\mathcal{Y}(z;t)\mathcal{Y}(w;s):, (1.1)

where

Ft,s(u)=exp(2\slimits@n1n odd1sn1tnunn).F_{t,s}(u)=\exp\!\left(-2\sumop\slimits@_{\begin{subarray}{c}n\geq 1\\ n\text{ odd}\end{subarray}}\frac{1-s^{n}}{1-t^{n}}\frac{u^{n}}{n}\right). (1.2)

The specialization s=ts=t gives (1u)/(1+u)(1-u)/(1+u), which is the usual neutral factor. In the tt-adic completion, or analytically for |t|<1|t|<1, this mixed factor may also be written as

Ft,s(u)=(u;t)(su;t)(u;t)(su;t).F_{t,s}(u)=\frac{(u;t)_{\infty}(-su;t)_{\infty}}{(-u;t)_{\infty}(su;t)_{\infty}}.

We also derive a recurrence for the coefficients of Ft,s(u)F_{t,s}(u) and use the mixed product formula to compute coefficients after applying the operators to 𝟏\mathbf{1}.

The most concrete case is

s=tM,MZ>0.s=t^{M},\qquad M\in\mathbb Z_{>0}.

Then the infinite product reduces to the finite product

Ft,tM(u)=\slimits@j=0M11tju1+tju=(u;t)M(u;t)M.F_{t,t^{M}}(u)=\prodop\slimits@_{j=0}^{M-1}\frac{1-t^{j}u}{1+t^{j}u}=\frac{(u;t)_{M}}{(-u;t)_{M}}. (1.3)

If

Ft,tM(u)=\slimits@m0fm[M](t)um,F_{t,t^{M}}(u)=\sumop\slimits@_{m\geq 0}f_{m}^{[M]}(t)u^{m},

then

fm[M](t)=(1)mqm(1,t,,tM1).f_{m}^{[M]}(t)=(-1)^{m}q_{m}(1,t,\ldots,t^{M-1}). (1.4)

Therefore (1)mfm[M](t)(-1)^{m}f_{m}^{[M]}(t) is a nonnegative palindromic polynomial. We give an explicit Gaussian-binomial formula and a finite recurrence of order MM.

The paper is organized as follows. In section˜2 we review the odd power-sum ring and prove the diagonal-conjugation and plethystic formulas. In section˜3 we prove the general mixed product formula, its infinite-product form, its coefficient recurrence, and the corresponding coefficient formulas after applying the operators to 𝟏\mathbf{1}. In section˜4 we specialize to s=tMs=t^{M} and study the finite product and its coefficients.

2 The odd power-sum ring and diagonal conjugation

2.1 Strict partitions and Schur QQ-functions

A strict partition is a finite sequence λ=(λ1>>λ>0)\lambda=(\lambda_{1}>\cdots>\lambda_{\ell}>0). We write |λ|=λ1++λ|\lambda|=\lambda_{1}+\cdots+\lambda_{\ell} and (λ)=\ell(\lambda)=\ell. Let SP(N)\mathrm{SP}(N) denote the set of strict partitions of NN. Let OP(N)\mathrm{OP}(N) denote the set of partitions of NN all of whose parts are odd. Euler’s identity gives |SP(N)|=|OP(N)||\mathrm{SP}(N)|=|\mathrm{OP}(N)|.

Let

=Q[p1,p3,p5,]\Gamma=\mathbb{Q}[p_{1},p_{3},p_{5},\ldots]

be the odd power-sum ring, graded by degpn=n\deg p_{n}=n. For a partition α=(1m13m3)OP(N)\alpha=(1^{m_{1}}3^{m_{3}}\cdots)\in\mathrm{OP}(N), set

pα=\slimits@ipαi,zα=\slimits@r1rmrmr!.p_{\alpha}=\prodop\slimits@_{i}p_{\alpha_{i}},\qquad z_{\alpha}=\prodop\slimits@_{r\geq 1}r^{m_{r}}m_{r}!.

The elements pαp_{\alpha}, αOP(N)\alpha\in\mathrm{OP}(N), form a basis of the homogeneous component N.

We use the standard Schur QQ scalar product

pα,pβ=2(α)zαδαβ.\langle p_{\alpha},p_{\beta}\rangle=2^{-\ell(\alpha)}z_{\alpha}\,\delta_{\alpha\beta}. (2.1)

The Schur QQ-functions QλQ_{\lambda}, λSP(N)\lambda\in\mathrm{SP}(N), form another basis of N. We set

Pλ=2(λ)Qλ.P_{\lambda}=2^{-\ell(\lambda)}Q_{\lambda}.

Then

Qλ,Pμ=δλμ,Qλ,Qμ=2(λ)δλμ.\langle Q_{\lambda},P_{\mu}\rangle=\delta_{\lambda\mu},\qquad\langle Q_{\lambda},Q_{\mu}\rangle=2^{\ell(\lambda)}\delta_{\lambda\mu}. (2.2)

We follow the standard conventions in [5, Chapter III, Section 8]; see also [3, 7].

The one-row functions qr=Q(r)q_{r}=Q_{(r)} are determined by

QX(z):=\slimits@r0qr(X)zr=exp(2\slimits@n1n oddpn(X)nzn)=\slimits@i1+xiz1xiz.Q_{X}(z):=\sumop\slimits@_{r\geq 0}q_{r}(X)z^{r}=\exp\!\left(2\sumop\slimits@_{\begin{subarray}{c}n\geq 1\\ n\text{ odd}\end{subarray}}\frac{p_{n}(X)}{n}z^{n}\right)=\prodop\slimits@_{i}\frac{1+x_{i}z}{1-x_{i}z}. (2.3)

Here q0=1q_{0}=1 and qr=0q_{r}=0 for r<0r<0. For rs0r\geq s\geq 0, define

Q(r,s)=qrqs+2\slimits@k=1s(1)kqr+kqsk.Q_{(r,s)}=q_{r}q_{s}+2\sumop\slimits@_{k=1}^{s}(-1)^{k}q_{r+k}q_{s-k}. (2.4)

In particular, Q(r,0)=qrQ_{(r,0)}=q_{r} and Q(r,r)=0Q_{(r,r)}=0. If λ\lambda has odd length, append a zero part. The Pfaffian Giambelli identity is

Qλ=Pf(Q(λi,λj)).Q_{\lambda}=\operatorname{Pf}\bigl(Q_{(\lambda_{i},\lambda_{j})}\bigr). (2.5)

For later use, define coefficients χαλ\chi_{\alpha}^{\lambda} by the power-sum expansion

Qλ=\slimits@αOP(|λ|)2(α)zαχαλpα.Q_{\lambda}=\sumop\slimits@_{\alpha\in\mathrm{OP}(|\lambda|)}\frac{2^{\ell(\alpha)}}{z_{\alpha}}\chi_{\alpha}^{\lambda}p_{\alpha}. (2.6)

With the usual normalization, these are the spin-character coefficients. Their representation-theoretic interpretation will not be used below; we only need (2.6) and the orthogonality implied by (2.1).

2.2 The modified neutral operator

Let tt be an indeterminate and work over Q(t)\mathbb{Q}(t). For positive odd nn, set

an=pn,an=n2pn.a_{-n}=p_{n},\qquad a_{n}=\frac{n}{2}\frac{\partial}{\partial p_{n}}. (2.7)

Then

[am,an]=m2δm,n(m,n odd).[a_{m},a_{n}]=\frac{m}{2}\delta_{m,-n}\qquad(m,n\text{ odd}). (2.8)

The classical neutral operator is

(z)=exp(\slimits@n1n odd2nanzn)exp(\slimits@n1n odd2nanzn).\Phi(z)=\exp\!\left(\sumop\slimits@_{\begin{subarray}{c}n\geq 1\\ n\text{ odd}\end{subarray}}\frac{2}{n}a_{-n}z^{n}\right)\exp\!\left(-\sumop\slimits@_{\begin{subarray}{c}n\geq 1\\ n\text{ odd}\end{subarray}}\frac{2}{n}a_{n}z^{-n}\right). (2.9)

Its Fourier expansion is

(z)=\slimits@mZϕmzm.\Phi(z)=\sumop\slimits@_{m\in\mathbb Z}\phi_{m}z^{-m}.

Following [4], define the modified operator

𝒴(z;t)=exp(\slimits@n1n odd2(1tn)nanzn)exp(\slimits@n1n odd2n(1tn)anzn).\mathcal{Y}(z;t)=\exp\!\left(\sumop\slimits@_{\begin{subarray}{c}n\geq 1\\ n\text{ odd}\end{subarray}}\frac{2(1-t^{n})}{n}a_{-n}z^{n}\right)\exp\!\left(-\sumop\slimits@_{\begin{subarray}{c}n\geq 1\\ n\text{ odd}\end{subarray}}\frac{2}{n(1-t^{n})}a_{n}z^{-n}\right). (2.10)

In terms of derivatives, the second exponential equals

exp(\slimits@n1n odd11tnpnzn).\exp\!\left(-\sumop\slimits@_{\begin{subarray}{c}n\geq 1\\ n\text{ odd}\end{subarray}}\frac{1}{1-t^{n}}\frac{\partial}{\partial p_{n}}z^{-n}\right).

Write

𝒴(z;t)=\slimits@mZ𝒴m(t)zm.\mathcal{Y}(z;t)=\sumop\slimits@_{m\in\mathbb Z}\mathcal{Y}_{m}(t)z^{-m}. (2.11)

For a strict partition λ=(λ1>>λ>0)\lambda=(\lambda_{1}>\cdots>\lambda_{\ell}>0), set

𝒬λ(X;t)=𝒴λ1(t)𝒴λ(t)𝟏.\mathcal{Q}_{\lambda}(X;t)=\mathcal{Y}_{-\lambda_{1}}(t)\cdots\mathcal{Y}_{-\lambda_{\ell}}(t)\mathbf{1}. (2.12)

2.3 Diagonal conjugation

Define the graded algebra automorphism

ρt:Q(t),Q(t)ρt(pn)=(1tn)pn(n odd).\rho_{t}:{}_{\mathbb{Q}(t)}\longrightarrow{}_{\mathbb{Q}(t)},\qquad\rho_{t}(p_{n})=(1-t^{n})p_{n}\quad(n\text{ odd}). (2.13)

Its inverse is given by ρt1(pn)=(1tn)1pn\rho_{t}^{-1}(p_{n})=(1-t^{n})^{-1}p_{n}.

Proposition 2.1 (Diagonal conjugation).

The modified operator is a conjugate of the classical neutral operator:

𝒴(z;t)=ρt(z)ρt1.\mathcal{Y}(z;t)=\rho_{t}\Phi(z)\rho_{t}^{-1}. (2.14)

Consequently,

𝒬λ(X;t)=ρtQλ(X)=Qλ[XtX].\mathcal{Q}_{\lambda}(X;t)=\rho_{t}Q_{\lambda}(X)=Q_{\lambda}[X-tX]. (2.15)
Proof.

Because ana_{-n} is multiplication by pnp_{n},

ρtanρt1=(1tn)an.\rho_{t}a_{-n}\rho_{t}^{-1}=(1-t^{n})a_{-n}.

For fQ(t)f\in{}_{\mathbb{Q}(t)},

ρtpnρt1f=11tnfpn.\rho_{t}\frac{\partial}{\partial p_{n}}\rho_{t}^{-1}f=\frac{1}{1-t^{n}}\frac{\partial f}{\partial p_{n}}.

Hence

ρtanρt1=11tnan.\rho_{t}a_{n}\rho_{t}^{-1}=\frac{1}{1-t^{n}}a_{n}.

Conjugating the two exponentials in (2.9) gives exactly (2.10), proving (2.14).

Since ρt1𝟏=𝟏\rho_{t}^{-1}\mathbf{1}=\mathbf{1}, the mode expansion of (2.14) gives

𝒬λ(X;t)\displaystyle\mathcal{Q}_{\lambda}(X;t) =ρtϕλ1ρt1ρtϕλρt1𝟏\displaystyle=\rho_{t}\phi_{-\lambda_{1}}\rho_{t}^{-1}\cdots\rho_{t}\phi_{-\lambda_{\ell}}\rho_{t}^{-1}\mathbf{1}
=ρtϕλ1ϕλ𝟏=ρtQλ(X).\displaystyle=\rho_{t}\phi_{-\lambda_{1}}\cdots\phi_{-\lambda_{\ell}}\mathbf{1}=\rho_{t}Q_{\lambda}(X).

In plethystic notation, pn[XtX]=(1tn)pn[X]p_{n}[X-tX]=(1-t^{n})p_{n}[X], which proves the final equality in (2.15). ∎

Corollary 2.2.

For λSP(N)\lambda\in\mathrm{SP}(N),

𝒬λ(X;t)=\slimits@αOP(N)2(α)zαχαλ\slimits@aα(1ta)pα(X).\mathcal{Q}_{\lambda}(X;t)=\sumop\slimits@_{\alpha\in\mathrm{OP}(N)}\frac{2^{\ell(\alpha)}}{z_{\alpha}}\chi_{\alpha}^{\lambda}\prodop\slimits@_{a\in\alpha}(1-t^{a})p_{\alpha}(X). (2.16)

In particular, 𝒬λ(X;t)\mathcal{Q}_{\lambda}(X;t) is polynomial in tt with coefficients in .

Proof.

Apply ρt\rho_{t} to (2.6) and use

ρt(pα)=\slimits@aα(1ta)pα.\rho_{t}(p_{\alpha})=\prodop\slimits@_{a\in\alpha}(1-t^{a})p_{\alpha}.

Remark 2.3.

The operator (2.10) itself cannot be specialized directly at t=1t=1 because its second exponential contains (1tn)1(1-t^{n})^{-1}. The functions in (2.16), however, are polynomial in tt. For every nonempty strict partition λ\lambda,

𝒬λ(X;1)=0.\mathcal{Q}_{\lambda}(X;1)=0.

Thus the specialization of the functions exists even though the specialization of the operator does not.

Remark 2.4.

Every odd power sum is primitive:

(pn)=pn1+1pn.\Delta(p_{n})=p_{n}\otimes 1+1\otimes p_{n}.

It follows that ρt\rho_{t} is a graded Hopf algebra automorphism over Q(t)\mathbb{Q}(t). In particular, same-parameter product and coproduct identities for the 𝒬λ(X;t)\mathcal{Q}_{\lambda}(X;t) are transported directly from the classical Schur QQ theory. The new part of the story appears when two different parameters are compared.

3 Mixed operator products

We now work over K=Q(t,s)\mathbb{K}=\mathbb{Q}(t,s). Write

At(z)=\slimits@n1n odd2(1tn)nanzn,Bt(z)=\slimits@n1n odd2n(1tn)anzn.A_{t}(z)=\sumop\slimits@_{\begin{subarray}{c}n\geq 1\\ n\text{ odd}\end{subarray}}\frac{2(1-t^{n})}{n}a_{-n}z^{n},\qquad B_{t}(z)=-\sumop\slimits@_{\begin{subarray}{c}n\geq 1\\ n\text{ odd}\end{subarray}}\frac{2}{n(1-t^{n})}a_{n}z^{-n}. (3.1)

Then

𝒴(z;t)=eAt(z)eBt(z).\mathcal{Y}(z;t)=e^{A_{t}(z)}e^{B_{t}(z)}.

We put the AA-parts to the left and the BB-parts to the right, and write

:𝒴(z;t)𝒴(w;s):=eAt(z)+As(w)eBt(z)+Bs(w).:\mathcal{Y}(z;t)\mathcal{Y}(w;s):=e^{A_{t}(z)+A_{s}(w)}e^{B_{t}(z)+B_{s}(w)}. (3.2)

All scalar factors below are expanded as formal power series in w/zw/z.

3.1 The mixed operator product expansion

Theorem 3.1 (Mixed operator product).

For independent parameters tt and ss,

𝒴(z;t)𝒴(w;s)=Ft,s(w/z):𝒴(z;t)𝒴(w;s):,\mathcal{Y}(z;t)\mathcal{Y}(w;s)=F_{t,s}(w/z):\mathcal{Y}(z;t)\mathcal{Y}(w;s):, (3.3)

where

Ft,s(u)=exp(2\slimits@n1n odd1sn1tnunn)K[[u]].F_{t,s}(u)=\exp\!\left(-2\sumop\slimits@_{\begin{subarray}{c}n\geq 1\\ n\text{ odd}\end{subarray}}\frac{1-s^{n}}{1-t^{n}}\frac{u^{n}}{n}\right)\in\mathbb{K}[[u]]. (3.4)

When s=ts=t,

Ft,t(u)=1u1+u.F_{t,t}(u)=\frac{1-u}{1+u}. (3.5)
Proof.

The AA-parts commute with each other, and the BB-parts also commute with each other. By (2.8),

=\slimits@m,n1m,n odd2m(1tm)2(1sn)n[am,an]zmwn\displaystyle=-\sumop\slimits@_{\begin{subarray}{c}m,n\geq 1\\ m,n\text{ odd}\end{subarray}}\frac{2}{m(1-t^{m})}\frac{2(1-s^{n})}{n}[a_{m},a_{-n}]z^{-m}w^{n}
=2\slimits@n1n odd1sn1tn(w/z)nn.\displaystyle=-2\sumop\slimits@_{\begin{subarray}{c}n\geq 1\\ n\text{ odd}\end{subarray}}\frac{1-s^{n}}{1-t^{n}}\frac{(w/z)^{n}}{n}.

This commutator is a scalar. Therefore

eBt(z)eAs(w)=e[Bt(z),As(w)]eAs(w)eBt(z).e^{B_{t}(z)}e^{A_{s}(w)}=e^{[B_{t}(z),A_{s}(w)]}e^{A_{s}(w)}e^{B_{t}(z)}.

Substituting this into eAt(z)eBt(z)eAs(w)eBs(w)e^{A_{t}(z)}e^{B_{t}(z)}e^{A_{s}(w)}e^{B_{s}(w)} proves (3.3) and (3.4).

If s=ts=t, the ratio in (3.4) is 11. Since

2\slimits@n1n oddunn=log1+u1u,2\sumop\slimits@_{\begin{subarray}{c}n\geq 1\\ n\text{ odd}\end{subarray}}\frac{u^{n}}{n}=\log\frac{1+u}{1-u},

we obtain (3.5). ∎

Corollary 3.2 (Several mixed operators).

For parameters t1,,trt_{1},\ldots,t_{r},

𝒴(z1;t1)𝒴(zr;tr)=\slimits@1i<jrFti,tj(zj/zi):𝒴(z1;t1)𝒴(zr;tr):.\mathcal{Y}(z_{1};t_{1})\cdots\mathcal{Y}(z_{r};t_{r})=\prodop\slimits@_{1\leq i<j\leq r}F_{t_{i},t_{j}}(z_{j}/z_{i}):\mathcal{Y}(z_{1};t_{1})\cdots\mathcal{Y}(z_{r};t_{r}):. (3.6)

Each factor is expanded in nonnegative powers of zj/ziz_{j}/z_{i}.

Proof.

Move the BB-part of the iith operator through the AA-parts of the operators to its right. Each ordered pair i<ji<j contributes exactly the scalar factor computed in theorem˜3.1. ∎

3.2 Infinite-product form and coefficient recurrence

For m0m\geq 0, let

(a;t)m=\slimits@j=0m1(1atj),(a;t)=\slimits@j0(1atj).(a;t)_{m}=\prodop\slimits@_{j=0}^{m-1}(1-at^{j}),\qquad(a;t)_{\infty}=\prodop\slimits@_{j\geq 0}(1-at^{j}).
Proposition 3.3.

Analytically for |t|<1|t|<1, or formally in the tt-adic completion,

Ft,s(u)=(u;t)(su;t)(u;t)(su;t).F_{t,s}(u)=\frac{(u;t)_{\infty}(-su;t)_{\infty}}{(-u;t)_{\infty}(su;t)_{\infty}}. (3.7)
Proof.

Use

1sn1tn=\slimits@j0tjn\slimits@j0(stj)n\frac{1-s^{n}}{1-t^{n}}=\sumop\slimits@_{j\geq 0}t^{jn}-\sumop\slimits@_{j\geq 0}(st^{j})^{n}

in (3.4). For each variable xx,

exp(2\slimits@n oddxnn)=1x1+x.\exp\!\left(-2\sumop\slimits@_{n\text{ odd}}\frac{x^{n}}{n}\right)=\frac{1-x}{1+x}.

It follows that

Ft,s(u)=\slimits@j0(1tju)(1+stju)(1+tju)(1stju),F_{t,s}(u)=\prodop\slimits@_{j\geq 0}\frac{(1-t^{j}u)(1+st^{j}u)}{(1+t^{j}u)(1-st^{j}u)},

which is (3.7). ∎

Write

Ft,s(u)=\slimits@m0fm(t,s)um,f0(t,s)=1.F_{t,s}(u)=\sumop\slimits@_{m\geq 0}f_{m}(t,s)u^{m},\qquad f_{0}(t,s)=1. (3.8)
Proposition 3.4 (Coefficient recurrence).

For m1m\geq 1,

mfm(t,s)=2\slimits@1jmj odd1sj1tjfmj(t,s).mf_{m}(t,s)=-2\sumop\slimits@_{\begin{subarray}{c}1\leq j\leq m\\ j\text{ odd}\end{subarray}}\frac{1-s^{j}}{1-t^{j}}f_{m-j}(t,s). (3.9)
Proof.

Logarithmically differentiate (3.4):

uFt,s(u)=2Ft,s(u)\slimits@j odd1sj1tjuj.uF^{\prime}_{t,s}(u)=-2F_{t,s}(u)\sumop\slimits@_{j\text{ odd}}\frac{1-s^{j}}{1-t^{j}}u^{j}.

Comparing the coefficient of umu^{m} gives (3.9). ∎

3.3 Coefficients after applying the operators to 𝟏\mathbf{1}

Define the modified one-row series

𝖧t(X;z):=𝒴(z;t)𝟏=exp(2\slimits@n1n odd1tnnpn(X)zn)=\slimits@r0qr(X;t)zr.\mathsf{H}_{t}(X;z):=\mathcal{Y}(z;t)\mathbf{1}=\exp\!\left(2\sumop\slimits@_{\begin{subarray}{c}n\geq 1\\ n\text{ odd}\end{subarray}}\frac{1-t^{n}}{n}p_{n}(X)z^{n}\right)=\sumop\slimits@_{r\geq 0}q_{r}(X;t)z^{r}. (3.10)

Thus qr(X;t)=𝒴r(t)𝟏q_{r}(X;t)=\mathcal{Y}_{-r}(t)\mathbf{1}.

For r,m0r,m\geq 0, define the mixed two-row coefficient

𝒬r,mt,s(X):=[zrwm]𝒴(z;t)𝒴(w;s)𝟏=𝒴r(t)𝒴m(s)𝟏.\mathcal{Q}_{r,m}^{t,s}(X):=[z^{r}w^{m}]\mathcal{Y}(z;t)\mathcal{Y}(w;s)\mathbf{1}=\mathcal{Y}_{-r}(t)\mathcal{Y}_{-m}(s)\mathbf{1}. (3.11)

When tst\neq s, these coefficients are not skew-symmetric in rr and mm, so we do not regard them as a strict-partition basis.

Proposition 3.5.

For r,m0r,m\geq 0,

𝒬r,mt,s(X)=\slimits@k=0mfk(t,s)qr+k(X;t)qmk(X;s).\mathcal{Q}_{r,m}^{t,s}(X)=\sumop\slimits@_{k=0}^{m}f_{k}(t,s)q_{r+k}(X;t)q_{m-k}(X;s). (3.12)

For s=ts=t, this becomes

𝒬r,mt,t(X)=qr(X;t)qm(X;t)+2\slimits@k=1m(1)kqr+k(X;t)qmk(X;t).\mathcal{Q}_{r,m}^{t,t}(X)=q_{r}(X;t)q_{m}(X;t)+2\sumop\slimits@_{k=1}^{m}(-1)^{k}q_{r+k}(X;t)q_{m-k}(X;t). (3.13)
Proof.

Applying (3.3) to 𝟏\mathbf{1} gives

𝒴(z;t)𝒴(w;s)𝟏=Ft,s(w/z)𝖧t(X;z)𝖧s(X;w).\mathcal{Y}(z;t)\mathcal{Y}(w;s)\mathbf{1}=F_{t,s}(w/z)\mathsf{H}_{t}(X;z)\mathsf{H}_{s}(X;w).

Substitute (3.8) and (3.10). To obtain zrwmz^{r}w^{m}, the three indices must satisfy

zkzr+k=zr,wkwmk=wm,z^{-k}z^{r+k}=z^{r},\qquad w^{k}w^{m-k}=w^{m},

which gives (3.12). If s=ts=t, then

1u1+u=1+2\slimits@k1(1)kuk,\frac{1-u}{1+u}=1+2\sumop\slimits@_{k\geq 1}(-1)^{k}u^{k},

so (3.13) follows. ∎

4 Cyclotomic mixed products

Fix a positive integer MM and define the finite plethystic alphabet

AM(t)=1+t++tM1.A_{M}(t)=1+t+\cdots+t^{M-1}. (4.1)

We call a polynomial f(t)f(t) palindromic of darga dd if f(t)=tdf(t1)f(t)=t^{d}f(t^{-1}); this convention permits zero coefficients at both ends of the ambient degree interval [0,d][0,d]. For every n1n\geq 1,

pn[AM(t)]=1+tn++t(M1)n=1tMn1tn.p_{n}[A_{M}(t)]=1+t^{n}+\cdots+t^{(M-1)n}=\frac{1-t^{Mn}}{1-t^{n}}. (4.2)

4.1 Finite mixed scalar factors

Theorem 4.1 (Cyclotomic mixed product).

For M1M\geq 1,

𝒴(z;t)𝒴(w;tM)=(w/z;t)M(w/z;t)M:𝒴(z;t)𝒴(w;tM):.\mathcal{Y}(z;t)\mathcal{Y}(w;t^{M})=\frac{(w/z;t)_{M}}{(-w/z;t)_{M}}:\mathcal{Y}(z;t)\mathcal{Y}(w;t^{M}):. (4.3)

Equivalently,

Ft,tM(u)=\slimits@j=0M11tju1+tju=(u;t)M(u;t)M.F_{t,t^{M}}(u)=\prodop\slimits@_{j=0}^{M-1}\frac{1-t^{j}u}{1+t^{j}u}=\frac{(u;t)_{M}}{(-u;t)_{M}}. (4.4)
Proof.

By (3.4) and (4.2),

logFt,tM(u)\displaystyle\log F_{t,t^{M}}(u) =2\slimits@n odd(\slimits@j=0M1tjn)unn\displaystyle=-2\sumop\slimits@_{n\text{ odd}}\left(\sumop\slimits@_{j=0}^{M-1}t^{jn}\right)\frac{u^{n}}{n}
=\slimits@j=0M1log1tju1+tju.\displaystyle=\sumop\slimits@_{j=0}^{M-1}\log\frac{1-t^{j}u}{1+t^{j}u}.

Exponentiating gives (4.4), and (4.3) follows from theorem˜3.1. ∎

Write

Ft,tM(u)=\slimits@m0fm[M](t)um.F_{t,t^{M}}(u)=\sumop\slimits@_{m\geq 0}f_{m}^{[M]}(t)u^{m}. (4.5)
Proposition 4.2 (Principal specialization).

For every m0m\geq 0,

fm[M](t)=(1)mqm(1,t,,tM1).f_{m}^{[M]}(t)=(-1)^{m}q_{m}(1,t,\ldots,t^{M-1}). (4.6)

In particular,

(1)mfm[M](t)N[t].(-1)^{m}f_{m}^{[M]}(t)\in\mathbb{N}[t]. (4.7)

Moreover,

(1)mfm[M](t)=\slimits@a=0min(M,m)t(a2)[Ma]t[M+ma1ma]t.(-1)^{m}f_{m}^{[M]}(t)=\sumop\slimits@_{a=0}^{\min(M,m)}t^{\binom{a}{2}}\genfrac{[}{]}{0.0pt}{}{M}{a}_{t}\genfrac{[}{]}{0.0pt}{}{M+m-a-1}{m-a}_{t}. (4.8)
Proof.

By (2.3),

\slimits@m0qm(1,t,,tM1)zm=\slimits@j=0M11+tjz1tjz.\sumop\slimits@_{m\geq 0}q_{m}(1,t,\ldots,t^{M-1})z^{m}=\prodop\slimits@_{j=0}^{M-1}\frac{1+t^{j}z}{1-t^{j}z}.

Substitute z=uz=-u and compare with (4.4); this proves (4.6) and (4.7).

For the explicit formula, use the finite and reciprocal qq-binomial expansions

\slimits@j=0M1(1+tju)=\slimits@a=0Mt(a2)[Ma]tua\prodop\slimits@_{j=0}^{M-1}(1+t^{j}u)=\sumop\slimits@_{a=0}^{M}t^{\binom{a}{2}}\genfrac{[}{]}{0.0pt}{}{M}{a}_{t}u^{a}

and

\slimits@j=0M111tju=\slimits@b0[M+b1b]tub.\prodop\slimits@_{j=0}^{M-1}\frac{1}{1-t^{j}u}=\sumop\slimits@_{b\geq 0}\genfrac{[}{]}{0.0pt}{}{M+b-1}{b}_{t}u^{b}.

The coefficient of umu^{m} in their product is the right side of (4.8). ∎

Corollary 4.3 (Reciprocity for scalar factors).

For every m0m\geq 0,

fm[M](t)=t(M1)mfm[M](t1).f_{m}^{[M]}(t)=t^{(M-1)m}f_{m}^{[M]}(t^{-1}). (4.9)

Thus (1)mfm[M](t)(-1)^{m}f_{m}^{[M]}(t) is palindromic with darga (M1)m(M-1)m.

Proof.

As multisets,

AM(t)=tM1AM(t1).A_{M}(t)=t^{M-1}A_{M}(t^{-1}).

Since qmq_{m} is homogeneous of degree mm,

qm[AM(t)]=t(M1)mqm[AM(t1)].q_{m}[A_{M}(t)]=t^{(M-1)m}q_{m}[A_{M}(t^{-1})].

Apply (4.6). ∎

Proposition 4.4 (Finite-order recurrence).

Set

ej[M](t):=ej(1,t,,tM1)=t(j2)[Mj]t,0jM.e_{j}^{[M]}(t):=e_{j}(1,t,\ldots,t^{M-1})=t^{\binom{j}{2}}\genfrac{[}{]}{0.0pt}{}{M}{j}_{t},\qquad 0\leq j\leq M. (4.10)

Then the coefficients in (4.5) satisfy

\slimits@j=0min(M,m)ej[M](t)fmj[M](t)={(1)mem[M](t),0mM,0,m>M.\sumop\slimits@_{j=0}^{\min(M,m)}e_{j}^{[M]}(t)f_{m-j}^{[M]}(t)=\begin{cases}(-1)^{m}e_{m}^{[M]}(t),&0\leq m\leq M,\\ 0,&m>M.\end{cases} (4.11)

In particular, for m>Mm>M,

fm[M](t)=\slimits@j=1Mej[M](t)fmj[M](t).f_{m}^{[M]}(t)=-\sumop\slimits@_{j=1}^{M}e_{j}^{[M]}(t)f_{m-j}^{[M]}(t). (4.12)
Proof.

The numerator and denominator in (4.4) expand as

(u;t)M=\slimits@j=0M(1)jej[M](t)uj,(u;t)M=\slimits@j=0Mej[M](t)uj.(u;t)_{M}=\sumop\slimits@_{j=0}^{M}(-1)^{j}e_{j}^{[M]}(t)u^{j},\qquad(-u;t)_{M}=\sumop\slimits@_{j=0}^{M}e_{j}^{[M]}(t)u^{j}.

Multiplying

(u;t)M\slimits@m0fm[M](t)um=(u;t)M(-u;t)_{M}\sumop\slimits@_{m\geq 0}f_{m}^{[M]}(t)u^{m}=(u;t)_{M}

and comparing the coefficient of umu^{m} gives (4.11). The homogeneous recurrence follows when m>Mm>M. ∎

Corollary 4.5 (Cyclotomic mixed coefficients).

For r,m0r,m\geq 0,

𝒬r,mt,tM(X)=\slimits@k=0m(1)kqk(1,t,,tM1)qr+k(X;t)qmk(X;tM).\mathcal{Q}_{r,m}^{t,t^{M}}(X)=\sumop\slimits@_{k=0}^{m}(-1)^{k}q_{k}(1,t,\ldots,t^{M-1})q_{r+k}(X;t)q_{m-k}(X;t^{M}). (4.13)
Proof.

Combine proposition˜3.5 with (4.6). ∎

Example 4.6 (The case M=2M=2).

For M=2M=2,

Ft,t2(u)=(1u)(1tu)(1+u)(1+tu).F_{t,t^{2}}(u)=\frac{(1-u)(1-tu)}{(1+u)(1+tu)}.

Here

e1[2](t)=1+t,e2[2](t)=t,e_{1}^{[2]}(t)=1+t,\qquad e_{2}^{[2]}(t)=t,

and

f0[2](t)\displaystyle f_{0}^{[2]}(t) =1,\displaystyle=1,
f1[2](t)\displaystyle f_{1}^{[2]}(t) =2(1+t),\displaystyle=-2(1+t),
f2[2](t)\displaystyle f_{2}^{[2]}(t) =2(1+t)2,\displaystyle=2(1+t)^{2},
f3[2](t)\displaystyle f_{3}^{[2]}(t) =2(1+t)(1+t+t2).\displaystyle=-2(1+t)(1+t+t^{2}).

For m>2m>2, the coefficients satisfy

fm[2](t)=(1+t)fm1[2](t)tfm2[2](t).f_{m}^{[2]}(t)=-(1+t)f_{m-1}^{[2]}(t)-tf_{m-2}^{[2]}(t).

References

  • [1] G. Greaves, N. Jing, and H. Zhu, Vertex operators, infinite wedge representations, and correlation functions of the tt-Schur measure, arXiv:2602.14190, 2026.
  • [2] V. N. Ivanov, Interpolation analogues of Schur QQ-functions, J. Math. Sci. (N.Y.) 131 (2005), no. 3, 5495–5507.
  • [3] N. Jing, Vertex operators, symmetric functions, and the spin group n, J. Algebra 138 (1991), no. 2, 340–398.
  • [4] S.-J. Lee, A modified Greaves–Jing–Zhu operator and a shifted tt-Gessel formula, arXiv:2606.22058, 2026.
  • [5] I. G. Macdonald, Symmetric Functions and Hall Polynomials, second ed., Oxford University Press, Oxford, 1995.
  • [6] N. Rozhkovskaya, Linear transformations of vertex operator presentations of Hall–Littlewood polynomials, arXiv:2202.01544, 2022.
  • [7] J. R. Stembridge, Shifted tableaux and the projective representations of symmetric groups, Adv. Math. 74 (1989), no. 1, 87–134.