Pith. sign in

REVIEW 3 major objections 5 minor 11 references

Five-Term Relations for wreath Macdonald polynomials and tableau formulas for Pieri coefficients

T0 review · 3 major / 5 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The paper proves a five-term operator identity for wreath Macdonald polynomials that reduces all Pieri and dual Pieri coefficients to explicit one-cell formulas, giving a fast tableau-style route to monomial expansions.

desk verdict Five-term relations and the resulting Pieri recursions are genuinely new and worth publishing, but the degree-one base case in Appendix A has a convergence/formal-limit gap that should be fixed before the formulas are relied on. read the letter →

arxiv 2505.15606 v3 pith:5TAD2FFJ submitted 2025-05-21 math.CO math.QAmath.RT

Marino Romero , Joshua Jeishing Wen This is my paper · ORCID
classification math.COmath.QAmath.RT MSC 05E0505E1033D5281R10
keywords wreathMacdonaldpolynomialsfive-termrelationsPiericoefficientstableauformulasmultisymmetricfunctionsplethysmnablaoperators
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper establishes a wreath-generalization of the classical five-term relation for modified Macdonald polynomials, replacing symmetric functions with multisymmetric functions in $r$ colors. The identity relates different compositions of multiplication and $\Delta$ operators, and extracting coefficients from it yields recursive formulas for all wreath Macdonald Pieri coefficients. These recursions reduce every coefficient to explicit degree-one rules, providing a fast tableau-style computation of the monomial expansion of wreath Macdonald polynomials. The same mechanism produces recursions for dual Pieri coefficients and connects a wreath version of Theta operators to the $D$-operators.

What carries the argument

The workhorse is the two-variable operator family $W(u,v) = P^{(p)}_{u/M^T}\Delta^{(s)}_v P^{(p)}_{-u/M^T}\Delta^{(s)}_{-v}$, where $P^{(i)}_A$ is multiplication by $\Omega[\epsilon_i A X^\bullet]$ and $\Delta^{(s)}_v = \Omega[-v\epsilon_s D/M]$. Two triangularity results show that when $W$ is expanded in powers $u^i v^j$, only the diagonal $j=i$ survives, and that the diagonal term equals $\nabla^{(s)} e_i[\epsilon_p X^\bullet/M^T](\nabla^{(s)})^{-1}$. Equating coefficients in the five-term identity and applying the result to $H_\lambda$ gives the recursions for Pieri and dual Pieri coefficients. The degree-one base cases are proved in Appendix A by iterated constant-term evaluation using the partial-fraction Lemma A.2 and the $D$-operator expression for $e_1$.

What would settle it

Compute $e_1[\epsilon_p X^\bullet/M^T]H_\lambda$ for a small $r=3$ partition $\lambda$, extract the coefficient of $H_\mu$ for each $\lambda\subset_1\mu$, and compare with formula (A.1); then feed these values into the $k=l=1$ case of (7.3) for a $\lambda\subset_2\mu$ and verify the identity. Any discrepancy locates the failure in the base case or the recursion.

Watch

Extended reading notes

Core claim

The central claim is the five-term operator identity $$\$nabla^{{(s)}}$ $P^{{(p)}}$_{-uv/M^T}(\$nabla^{{(s)}}$)^{-1} = $P^{{(p)}}$_{u/M^T}\$\Delta$^{(s)}_v $P^{{(p)}}$_{-u/M^T}\$\Delta$^{(s)}_{-v}$$ for the colored nabla operator $\nabla^{(s)}$, the multiplication operators $P^{(p)}_{A}$, and the $\Delta$ operators $\Delta^{(s)}_v$ acting on the ring of multisymmetric functions. From this identity, coefficient extraction yields recursive formulas for the coefficients $d^{(p)}_{\mu,\lambda}$ in $e_k[\epsilon_p X^\bullet/M^T]H_\lambda = \sum_{\lambda\subset_k\mu} d^{(p)}_{\mu,\lambda}H_\mu$, and for the dual coefficients $c^{(p)}_{\lambda,\mu}$ defined by skewing operators, with the explicit one-cell formulas of Propositions 7.7 and 7.13 as base cases. These recursions make the monomial expansion of a wreath Macdonald polynomial available by a finite tableau-style computation rather than by solving triangular systems from scratch.

Load-bearing premise

The whole recursion rests on the degree-one Pieri formula proved in Appendix A by a lengthy pole-cancellation calculation; if any of its eight cancellation cases misses an uncancelled term, that base formula is wrong and every recursive coefficient built on it inherits the mistake.

Editorial extensions

If this is right

  • The recursive formula (7.3) reduces every wreath Macdonald Pieri coefficient to degree-one data, so the monomial expansion of $H_\lambda$ is computed by iterated summation over intermediate partitions rather than by solving linear systems.
  • Dual Pieri coefficients, and hence the monomial expansion of the dagger basis $\{H^\dagger_\lambda\}$, are obtained from the mirror recursions of Theorems 7.10 and 7.12 with the same one-cell base data.
  • Because the color $s$ in the recursion may be chosen freely at every step, the same coefficient admits several different decompositions; the formulas therefore carry built-in consistency checks.
  • The five-term machinery expresses wreath Theta operators as sums of $D$-operators (Theorem 8.4), extending the Theta-operator toolkit from modified Macdonald polynomials to the wreath setting.
  • For a partition with nonempty core, the evaluation $H_\mu[-\epsilon_0]$ becomes computable as a dual Pieri coefficient through Theorem 7.14, turning an unknown evaluation into a tableau sum.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A bijective reading of the base-case formula (A.1) is not given here; if found, the addable and removable corner factors would likely amount to a single corner-weight statistic on tableaux.
  • Since the recursion is independent of the auxiliary color, comparing two choices of $s$ yields families of rational identities among sums over intermediate partitions; these are not stated in the paper but follow directly from equating the two recursions.
  • The same constant-term technique appears adaptable to $r=2$; in that limit the recursions should reproduce or refine the known tableau formulas for ordinary modified Macdonald Pieri coefficients, offering a check on the index bookkeeping.
  • The operator identity underlying Theorem 8.4 suggests that wreath Theta operators could be used to attack a future wreath analogue of the Delta conjecture, in parallel with how Theta operators were used in the classical case; the paper does not make that conjecture.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper develops wreath analogues of the Garsia–Mellit five-term relation for modified Macdonald polynomials. After introducing a vector-plethysm formalism, the authors use the wreath Tesler identity and the operator V from their companion preprint [RW25] to prove an operator identity (Theorem 7.4) relating ∇^(s), a colored nabla operator, to products of multiplication and Delta operators. They then extract recursive tableau formulas for wreath Macdonald Pieri coefficients (Theorem 7.5), dual Pieri coefficients (Theorems 7.10 and 7.12), and for the evaluation H_μ[−ϵ_0] (Theorem 7.14). The recursions are grounded in explicit degree-one Pieri formulas (Propositions 7.7 and 7.13), whose proofs are deferred to Appendix A, where they are derived from an iterated constant-term computation using the operators D and D*. The final section applies the five-term relations to prove commutation identities between wreath Theta operators and D-operators.

Significance. If the main identities hold, the paper gives a substantial advance in the functional theory of wreath Macdonald polynomials: it provides an efficient recursive algorithm for monomial expansions, establishes a wreath analogue of a central tool of Garsia and Mellit, and introduces wreath Theta operators with proven commutation relations. The main operator proofs in Section 7 are short and elegant, and the paper is unusually explicit about the computational base cases. The dependence on the companion preprint [RW25] is stated openly, and the final Pieri coefficient recursions do not merely restate the input: the degree-one base cases are proved in the appendix and the recursion genuinely propagates them. However, the appendix proof of the degree-one formulas has a formal gap in the convergence argument, and because every recursive tableau formula reduces to that base case, the correctness of the advertised computational method rests on this point.

major comments (3)
  1. [Appendix A, Eqs. (A.6)–(A.8)] The proof of the degree-one Pieri formula (A.1) is not formally justified as written. The 'enhanced convergence' condition (A.6) requires |p_q|, |p_t| < |q^a t^b| for all a,b ≥ 0; since the expansion in (A.4) uses |q|, |t| < 1, the quantities |q^a t^b| have infimum 0, so no nonzero choice of p_q, p_t satisfies (A.6) literally. Consequently the claim in A.1.3 that poles of the form (p_t^k z_i − χ_□) can be ignored, and the resulting eight-case coefficient computation in A.1.4, are not supported by a legitimate order of constant-term extraction. This is load-bearing: Theorems 7.5, 7.10, and 7.12 reduce every Pieri coefficient to (A.1)/(A.2), so an uncancelled pole or a missed case in Appendix A would invalidate the recursive formulas. The authors should either give a formal treatment of the iterated constants terms (for example, via finite truncations or an appropriate non-archimedean valuation), or supply an independent proof of (A.1) and (A.2).
  2. [Proposition 7.3 and Theorem 7.4] The proof of Proposition 7.3, which supplies the triangularity W_{i,j} = 0 for j < i needed in Theorem 7.4, is not self-contained: the step 'From the Pieri rules on the basis H†_μ ⊗ e_α' invokes an unstated lemma from [RW25], and the displayed conjugation by V does not by itself show the claimed polynomiality in u. Since Theorem 7.4 is the paper's central operator identity and all subsequent recursions depend on both triangularities, the authors should either prove this step in full or state and prove the precise [RW25] result being used.
  3. [Section 2 and Lemma A.5] The scope of the paper is inconsistent. Section 2 fixes r > 2, but Lemma A.5 and parts of the dual Pieri proof in Appendix A are stated for r > 1. The intended range of r should be stated precisely, and the small cases (r = 1 and r = 2, or whichever are excluded) should be checked explicitly, since Lemma A.5 explicitly relies on r > 1 and the paper gives no separate treatment of r = 2.
minor comments (5)
  1. [Title and Abstract] The title and abstract contain spacing or spelling artifacts ('RELA TIONS', 'T ABLEAU') that should be corrected in the final version.
  2. [Definition 2.1] The word 'paritition' should be 'partition'.
  3. [Section 6.2] The cross-reference 'Theorem 6.3' in the paragraph after Proposition 6.6 appears to refer to Proposition 6.3; the reference should be corrected.
  4. [Lemma A.2 and its use] Lemma A.2 assumes simple nonzero poles and a series F(z) in nonnegative powers of z; after the substitutions (A.7), the expressions evaluated at later steps can involve higher-order poles and denominators of the form (z_i − p_t^k χ_□), so the paper should explain explicitly how the lemma is being applied at each step.
  5. [Appendix A.1.4] In case (4) of the eight-case analysis, the text says a factor (z_i − q t χ_□) cancels, but the displayed factors in (A.7) contain (z_i − q t χ_□) only through the product over removable corners; the sentence should spell out the precise cancellation so the reader can verify the sign and the factor (χ_i − q t χ_i).

Circularity Check

0 steps flagged · score 2.0 of 10

No circularity: the five-term relation is a genuine consequence of imported [RW25] machinery, and the Pieri recursions' degree-one base cases are proved in Appendix A rather than assumed.

full rationale

Walking the derivation chain, no circular step is present. The five-term relation (Theorem 7.4) is deduced from two triangularity statements (Propositions 7.2 and 7.3), whose proofs import Pieri structural expansions and the V-map properties from the authors' companion preprint [RW25]. This is a dependency on overlapping-author work, not a reduction of the target identity to itself: the five-term relation and the tableau recursions are new conclusions drawn from that machinery, not restatements of it. The recursive Pieri formulas (Theorems 7.5, 7.10, 7.12) do not presuppose the coefficients they compute: each recursion reduces degree k+l coefficients to products of lower-degree coefficients, with the degree-one base cases (Proposition 7.7 and 7.13, i.e., (A.1) and (A.2)) proved independently in Appendix A by an iterated constant-term calculation, not by invoking the recursion. The degree-one proofs do lean on Lemmas A.2 and Corollary 4.13 from [RW25], but that is again an imported tool, and the final formulas are checked against a MAPLE implementation, giving an independent computational check. The suspicious convergence condition (A.6) and the r>2 versus r>1 scope ambiguity noted by a skeptic are correctness risks in the base-case proof, not circularity: they do not show that the output is identical to an input by construction. Accordingly the appropriate score is low, reflecting only the self-citation dependency rather than any identity-reducing circular step.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

The paper's central results are built on the wreath Tesler identity and the map V from the companion preprint [RW25] (Proposition 6.1, also the Pieri rule of [RW25, Lemma 4.3]), and on the norm formula Nλ from [OS24, Theorem 3.32]. The degree-one Pieri proof also uses identity (A.12) from [GT96]. There are no fitted free parameters; the final recursion formulas are explicit and parameter-free. The main uncertified technical assumption is the order of constant-term evaluations under the enhanced convergence conditions (A.6).

assumptions (5)
  • domain assumption Wreath Tesler identity and map V from [RW25]: V = ∇ P^(0)_(-1/M^T) T^(0)_1 ∇ with VF = F[ιD†]V, and the Pieri rule for ek[ϵp X•/M^T] (RW25, Lemma 4.3).
    Proposition 6.1 and Section 7 invoke these results from the companion preprint by the same authors; the five-term relations are derived on top of them.
  • domain assumption Norm formula Nλ of Proposition 4.3 from [OS24, Theorem 3.32].
    Used in Appendix A.2.3 (Lemma A.4) to convert dual Pieri coefficients via adjunction.
  • domain assumption Identity (A.12): product over i of (product over addable corners of (-χ□)) and (product over removable corners of (-qtχ□)) equals -1, cited from [GT96, Theorem 2.2].
    Used at the end of the constant-term computation to pass from (A.11) to Proposition 7.7.
  • ad hoc to paper Enhanced convergence conditions (A.6): |pq|,|pt| < |q^a t^b| for all a,b >= 0 allow iterated constant-term extraction with arbitrary pole order.
    No proof is given that these conditions are compatible with the specialization (pq,pt) to (q,t) in all configurations; if invalid, the base case formula may fail.
  • standard math The ring extension W = Λ⊗r ⊗ C[Q] and the star and Hall pairings are defined consistently (Section 4.1).
    These are standard constructions for multisymmetric functions with cores.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Five-Term Relations for wreath Macdonald polynomials and tableau formulas for Pieri coefficients." pith.science (2026). https://pith.science/paper/5TAD2FFJ

@misc{pith2026250515606,
  author       = {Pith},
  title        = {Pith review of: Five-Term Relations for wreath Macdonald polynomials and tableau formulas for Pieri coefficients},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/5TAD2FFJ}},
  note         = {Machine review of arXiv:2505.15606}
}
read the original abstract

We present a variety of new identities involving operators in the theory of wreath Macdonald polynomials. One such family of identities gives five-term relations, analogous to the one given by Garsia and Mellit for the modified Macdonald polynomials. As a consequence, we generate tableau formulas for wreath Macdonald Pieri coefficients, which give an incredibly quick way of computing their monomial expansions.

Figures

Figures reproduced from arXiv: 2505.15606 by the authors.

Figure 1
Figure 1. The Maya diagram for the partition (4, 2, 2). In [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. The quotient decomposition for λ = (4, 2, 2) when r = 3. The r-core core(λ) is the result of removing ribbons of length r from λ until it is no longer possible. We can obtain it from m(λ) by changing all mi(λ) into the vacuum diagrams centered at the ci-shifted central lines and then reconstituting the total Maya diagram. In [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Obtaining core(λ) for λ = (4, 2, 2) when r = 3. We can obtain any r-core in this way, and so they are in bijection with tuples of charges (c0, . . . , cr−1) such that c0 + · · · + cr−1 = 0, [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

11 extracted references · 11 canonical work pages

  1. [1]

    Tableaux formulas for M acdonald polynomials

    Fran c ois Bergeron and Mark Haiman. Tableaux formulas for M acdonald polynomials. Internat. J. Algebra Comput. , 23(4):833--852, 2013

    work page 2013

  2. [2]

    Theta operators, refined delta conjectures, and coinvariants

    Michele D'Adderio, Alessandro Iraci, and Anna Vanden Wyngaerd. Theta operators, refined delta conjectures, and coinvariants. Adv. Math. , 376:Paper No. 107447, 59, 2021

    work page 2021

  3. [3]

    A proof of the compositional delta conjecture

    Michele D'Adderio and Anton Mellit. A proof of the compositional delta conjecture. Adv. Math. , 402:Paper No. 108342, 17, 2022

    work page 2022

  4. [4]

    New identities for theta operators

    Michele D'Adderio and Marino Romero. New identities for theta operators. Trans. Amer. Math. Soc. , 376(8):5775--5807, 2023

    work page 2023

  5. [5]

    Five-term relation and M acdonald polynomials

    Adriano Garsia and Anton Mellit. Five-term relation and M acdonald polynomials. J. Combin. Theory Ser. A , 163:182--194, 2019

    work page 2019

  6. [6]

    A. M. Garsia and G. Tesler. Plethystic formulas for M acdonald q,t - K ostka coefficients. Adv. Math. , 123(2):144--222, 1996

    work page 1996

  7. [7]

    Haglund, J

    J. Haglund, J. B. Remmel, and A. T. Wilson. The delta conjecture. Trans. Amer. Math. Soc. , 370(6):4029--4057, 2018

    work page 2018

  8. [8]

    I. G. Macdonald. Symmetric functions and H all polynomials . Oxford Classic Texts in the Physical Sciences. The Clarendon Press, Oxford University Press, New York, second edition, 2015. With contribution by A. V. Zelevinsky and a foreword by Richard Stanley, Reprint of the 2008 paperback edition

    work page 2015

Show all 11 references
  1. [9]

    Wreath M acdonald polynomials, a survey

    Daniel Orr and Mark Shimozono. Wreath M acdonald polynomials, a survey. In A glimpse into geometric representation theory , volume 804 of Contemp. Math. , pages 123--169. Amer. Math. Soc., [Providence], RI, [2024] 2024

    2024

  2. [10]

    A proof of the theta operator conjecture

    Marino Romero. A proof of the theta operator conjecture. J. Combin. Theory Ser. A , 185:Paper No. 105535, 7, 2022

    2022

  3. [11]

    T esler identities for wreath M acdonald polynomials

    Marino Romero and Joshua Jeishing Wen. T esler identities for wreath M acdonald polynomials. arXiv preprint arXiv:2505.01732 , 2025

    2025 arXiv

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.