{"id":"3d442d06-e87b-4e37-8c8f-d6ac66e18d79","arxiv_id":"2505.15606","paper_version":3,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"New five-term operator relations for wreath Macdonald polynomials give tableau-style recursions that compute all Pieri and dual Pieri coefficients from explicit degree-one rules.","lead":"This paper proves wreath analogues of the Garsia-Mellit five-term relation, then turns them into recursive tableau formulas for wreath Macdonald Pieri coefficients. The recursions give a fast path to the monomial expansions of wreath Macdonald polynomials, objects tied to the geometry of Nakajima quiver varieties.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Degree-one base case (A.1) is the least secure link: its proof relies on a convergence order (A.6) that no nonzero pq,pt can satisfy as written, so an independent check of (A.1) is needed before the recursive tableau formulas are relied upon.","rationale":"I reviewed the main line: Theorem 7.4 is proved by two triangularity statements (Propositions 7.2 and 7.3), and then Theorems 7.5, 7.10, and 7.12 solve for the Pieri coefficients in terms of degree-one coefficients. Proposition 7.3's proof is terse but follows the V-conjugation pattern from [GM19] and [RW25], so I do not see a concrete algebraic error there. The most vulnerable point is the degree-one base case (A.1), exactly where the reader placed the condition. The literal inequality in (A.6) is impossible for nonzero p_q, p_t, so the claimed control on the order of constant-term evaluations is not a proof as written; the eight-case analysis is the only check of cancellations. This does not show the formula is false; it shows the base case is not yet established. The suggested MAPLE comparison is a feasible, decisive check. I agree with the reader's CONDITIONAL verdict; no new independent objection emerged. The r>2 versus r>1 discrepancy should be clarified but is secondary.","tokens_in":26443,"tokens_out":20130,"duration_ms":173572,"concrete_test":"Independently evaluate (A.1) for r=3, p=0,1,2 at the smallest nontrivial pair lambda=empty, mu=(1,1,1) by expanding e_1[epsilon_p X/M^T] H_lambda from Definition 4.1 in the wreath Macdonald basis; compare the coefficient of H_mu with the formula. Then repeat for lambda=(1), mu=(2,2). If the formula fails, the base case is wrong. If it passes, the remaining proof gap is the order-of-limits issue in (A.6), which can be settled by rewriting the computation with p_q, p_t as formal infinitesimals and checking that the final specialization to (q,t) is independent of the order in which the z_i are eliminated.","verdict_should_be":"UNCHANGED","load_bearing_attack":"All of the recursive tableau formulas (Theorems 7.5, 7.10, 7.12) reduce every wreath Macdonald Pieri coefficient to the degree-one rules (A.1)/(A.2), and those rules are proved only in Appendix A. The proof is an iterated constant-term evaluation whose legitimacy is controlled by the 'enhanced convergence' condition (A.6): |p_q|, |p_t| < |q^a t^b| for all a,b >= 0. Since the expansion in (A.4) takes |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 proof's assertion that the order of the z_i-eliminations is legitimate, and that poles such as (p_t^k z_i - chi_box) can be ignored, is not formally justified. The subsequent eight-case analysis in A.1.4 is the only control on signs and cancellations in (A.11); a missed pole or a mis-assigned case would change (A.1), and every recursive formula would inherit the error. There is also a scope ambiguity: Section 2 fixes r > 2, while Lemma A.5 and parts of Appendix A are stated for r > 1; the intended range of r should be stated and the small cases checked separately.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","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.","tokens_in":26745,"tokens_out":2725,"duration_ms":26608,"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":[{"comment":"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).","section":"Appendix A, Eqs. (A.6)–(A.8)"},{"comment":"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.","section":"Proposition 7.3 and Theorem 7.4"},{"comment":"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.","section":"Section 2 and Lemma A.5"}],"minor_comments":[{"comment":"The title and abstract contain spacing or spelling artifacts ('RELA TIONS', 'T ABLEAU') that should be corrected in the final version.","section":"Title and Abstract"},{"comment":"The word 'paritition' should be 'partition'.","section":"Definition 2.1"},{"comment":"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.","section":"Section 6.2"},{"comment":"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.","section":"Lemma A.2 and its use"},{"comment":"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).","section":"Appendix A.1.4"}],"recommendation":"major_revision","confidential_remarks":"The paper overlaps substantially with the authors' companion preprint [RW25], and the referee report correctly notes that the degree-one Pieri base case is the least secure link. The issue with condition (A.6) is not a matter of style: as written, it makes the appendix proof formally invalid. I would encourage the editor to send the revision back to the authors with a request for either a repaired constant-term argument or an independent verification of (A.1)/(A.2). If the authors can supply that, the paper is likely suitable for acceptance; in its current form, the advertised computational consequences rest on an unjustified base case."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Dear colleague,\n\nThe paper delivers what it promises: five-term relations for wreath Macdonald polynomials (Theorem 7.4) and recursive tableau formulas for all Pieri and dual Pieri coefficients (Theorems 7.5, 7.10, 7.12). These are genuinely new identities; the wreath case does not follow from Garsia–Mellit by a simple substitution. The vector plethysm setup in Section 3 is a clean notational device, and the proofs of the triangularity propositions are short and readable.\n\nThe mathematical core looks solid. The five-term relation is derived from the Tesler/V-map machinery of [RW25], an overlapping-author preprint, but the circularity burden is low: the final recursions do not just restate the input, and the degree-one base case is proved inside the paper. The eight-case coefficient analysis in Appendix A is plausible, and the formulas check out in spirit.\n\nThe soft spot is in that appendix. The \"enhanced convergence\" condition (A.6) requires |p_q|, |p_t| < |q^a t^b| for all a,b >= 0. With |q|,|t| < 1 the right-hand side has infimum 0, so no nonzero p_q, p_t satisfy it literally. The later substitution (p_q,p_t) -> (q,t) suggests a formal limit, but the paper does not supply the formal argument. This is not a fatal flaw, but it is exactly the kind of step a referee should check: every recursive formula inherits the base case. There is also a minor scope ambiguity: Section 2 fixes r > 2, while Lemma A.5 is stated for r > 1.\n\nThe citation pattern is fair. The dependence on [RW25] is explicit, and the genuinely new part is clearly marked. Including the MAPLE check from the acknowledgements as ancillary material would strengthen the empirical side.\n\nThis paper is for people working on wreath Macdonald polynomials, symmetric function identities, and Pieri rules. It deserves a serious referee. I would send it out, asking the authors to fix the convergence/formal-limit argument and clarify the scope of r.","headline":"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.","tokens_in":27283,"tokens_out":2494,"would_cite":true,"duration_ms":22613,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05E05","05E10","33D52","81R10"],"pacs":[],"model":"deepseek-v4-flash","headline":"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.","keywords":["wreath Macdonald polynomials","five-term relations","Pieri coefficients","tableau formulas","multisymmetric functions","plethysm","nabla operators"],"falsifier":"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.","tokens_in":26196,"feed_emoji":"🧮","tokens_out":13407,"duration_ms":115169,"temperature":0.7,"pith_summary":"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.","feed_headline":"Five-term identity computes wreath Macdonald Pieri coefficients","feed_subtitle":"New five-term identity reduces every Pieri coefficient to one-box rules, unlocking fast monomial expansions.","key_machinery":"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$.","core_discovery":"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.","pith_inferences":["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."],"forward_implications":["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."],"supporting_citations":[{"why":"Provides the original five-term relation for modified Macdonald polynomials, the prototype the paper extends to every pair of colors.","marker":"[GM19]"},{"why":"Supplies the wreath Tesler identity, the map V, the D-operators, the Pieri triangularity of Proposition 7.1, and the constant-term Lemma A.2 used throughout the proofs.","marker":"[R W25]"},{"why":"Introduces the wreath Macdonald polynomials whose Pieri coefficients and monomial expansions are the paper's subject.","marker":"[Hai03]"},{"why":"Provides the norm value $N_\\lambda$ used to pass between Pieri and dual Pieri coefficients by adjunction.","marker":"[OS24]"},{"why":"Supplies the product identity (A.12) used in Appendix A to normalize the degree-one Pieri formula.","marker":"[GT96]"}],"fun_headline_variants":["Five-term identity unlocks fast Pieri coefficients","Tableau formulas from five-term identity","Quick Pieri coefficients via five-term rule","Five-term relation gives one-step Pieri coefficients","Five-term rule turns Pieri coefficients into tableaux"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"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.","fun_headline_variants_meta":{"raw":{"variants":["Five-term identity unlocks fast Pieri coefficients","Tableau formulas from five-term identity","Quick Pieri coefficients via five-term rule","Five-term relation gives one-step Pieri coefficients","Five-term rule turns Pieri coefficients into tableaux"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000899,"raw_usage":{"total_tokens":3813,"prompt_tokens":831,"completion_tokens":2982,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":447,"completion_tokens_details":{"reasoning_tokens":2914}},"tokens_in":447,"tokens_out":2982,"duration_ms":20340,"temperature":1.0,"reasoning_tokens":2914,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-07T15:13:24.036303+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"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.","supporting_citations":[],"review_version":1}