{"id":"3dec3995-8d88-4814-b58c-1d2a7b35341f","arxiv_id":"2505.01732","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"For r>2, an explicit operator identity (Tesler identity) relates each wreath Macdonald polynomial to a delta function and yields Macdonald-Koornwinder duality, evaluation, interpolation, Kostka, and bispectral results.","lead":"The authors prove a wreath analogue of the classical Tesler identity: an explicit operator built from 'nabla' sends each wreath Macdonald polynomial to a delta function, unlocking reciprocity and evaluation formulas. This gives the wreath Macdonald program a compact computational tool analogous to the one Garsia, Haiman, and Tesler built for ordinary Macdonald polynomials.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 4.15, which turns the explicit operator V into the Tesler identity (1.6), rests on an unproved 'It should then be possible' nesting step imported from [Wen19]; if that combinatorial control fails, the central identity and all Section 6 consequences are unsupported.","rationale":"The reader's weakest_assumption identifies exactly the point I find most load-bearing: the proof of Theorem 4.15 depends on combinatorial control from [Wen19], and the paper itself flags the informal step 'It should then be possible' where a nonzero µ′ must be produced. My stress-test did not uncover a different or stronger objection: the explicit-operator proof in Theorem 4.18 is plausible and the Section 6 consequences do follow formally from (1.6) and (1.7), but the bridge from the abstractly defined V to the scalar-multiple claim is not fully proven. Since the reader already rendered a CONDITIONAL verdict with medium correctness risk, my analysis does not move the verdict; it reinforces it. The concern is not an ad hominem or a disagreement with consensus: it is a specific unproved combinatorial step in the central proof, compounded by the fact that the needed result lives in an unpublished preprint by the second author. A finite computational check can falsify the identity or the nesting condition, and a complete re-derivation of the nesting step would resolve the gap; absent that, conditional acceptance is the appropriate verdict.","tokens_in":63656,"tokens_out":9628,"duration_ms":101879,"concrete_test":"For r=3 and all λ with |quot(λ)| ≤ 4, enumerate the row-strict and column-strict r-tableaux of [Wen19, Section 5] and check explicitly whether the 'should then be possible' µ′ exists for every nonzero coefficient in the expansions (4.32) and (4.33); a single absent µ′ falsifies Theorem 4.15 as stated. Independently recompute both sides of the Tesler identity (1.6) for those same cases using the explicit formula for V, since any mismatch would likewise falsify the theorem, while success in these finite cases would localize the remaining issue to the missing infinite-family proof of the nesting condition.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The load-bearing statement is (1.6): once Eλ = V_core(λ)(Hλ / Hλ[ιD•_{w0core(λ)}]) is established, the Section 6 applications are largely formal. The proof splits into Theorem 4.18, giving the explicit formula for V, and Theorem 4.15, asserting that V(Hλ) is a scalar multiple of Eλ. Theorem 4.18 is long but proceeds through commutation relations and a base-case computation. Theorem 4.15, however, depends on combinatorial control imported from [Wen19, Section 5]. In the proof of Theorem 4.15, the paper uses Lemma 4.12 to say that the coefficients in (4.32) and (4.33) are governed by row-strict and column-strict r-tableaux, then needs a nested condition to identify the relevant tableaux as 'strongly row-strict λ-tabloidizable' and 'strongly column-strict λ-tabloidizable'. At the exact point where a nonzero µ′ must be produced, the text says: 'It should then be possible to produce such a µ′ that has nonzero coefficient in the expansion for ê_quot(λ′).' This is an explicit gap. Without that nesting step, the inclusions V(span{ê_quot(µ) : µ ≤_r λ}) ⊂ span{Eµ : µ ≤_r λ} and the analogous column-strict inclusion are not justified, so Proposition 2.9 cannot be invoked and V(Hλ) need not be a multiple of Eλ. The dependence on [Wen19] is not merely bibliographic: that preprint is authored by the second author and is not yet published, and the present paper does not supply the missing argument. If the nesting construction fails for some λ, Theorem 4.15 fails and (1.6) is unsupported.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"This paper develops a wreath analogue of the Tesler identity for modified Macdonald polynomials. For r>2 and an r-core α, the authors define an explicit operator Vα = ∇α Ω[X^(0)/((1-qσ^{-1})(tσ-1))] T[X^(0)] ∇α and claim (Theorem 1.1, Eq. (1.6)) that Eλ = V_core(λ)(Hλ / Hλ[ιD•_{w0 core(λ)}]), where Eλ is a delta function for the wreath Macdonald pairing. The proof passes through an abstract map V (Definition 4.14), a formula for V (Theorem 4.18) obtained by commutation relations and a long constant-term computation, and a theorem (Theorem 4.15) identifying V(Hλ) with a scalar multiple of Eλ. The final sections derive consequences: Macdonald–Koornwinder duality, evaluation formulas, shifted reciprocity, interpolation polynomials, plethystic Kostka coefficients, and a bispectral series. The paper is explicit that the main theorem is proved only for r>2 and that the r=2 case is left to future work.","tokens_in":63988,"tokens_out":6116,"duration_ms":62650,"significance":"If the main identity is correct, this is a substantial contribution: it extends the Garsia–Haiman–Tesler framework to wreath Macdonald polynomials, provides a closed-form operator identity, and yields a long list of new reciprocity and evaluation results. The paper is unusually explicit: the operator V is given in closed form, the statements are concrete and checkable, and the applications are formulated in a falsifiable way. I also credit the authors for clearly stating the r>2 restriction and for openly flagging the unresolved step in Theorem 4.15. On the other hand, the main theorem depends on unpublished work [Wen19] by the second author for the key combinatorial control, and no machine-checked proof or code is supplied; a reader cannot verify the long constant-term computations without substantial effort.","major_comments":[{"comment":"The proof of Theorem 4.15 rests on an unproved nesting assertion. After Lemma 4.12 is used to describe the coefficients in (4.32)–(4.33), the text says: 'It should then be possible to produce such a µ′ that has nonzero coefficient in the expansion for ê_quot(λ′).' This sentence is the exact point where the paper must show that the relevant tableaux are strongly row-strict and strongly column-strict λ-tabloidizable. Without a proof of this nesting step, the containments displayed after it do not follow, Proposition 2.9 cannot be applied, and the conclusion that V(Hλ ⊗ e_core(λ)) is a scalar multiple of Eλ ⊗ e_core(λ) is unsupported. Because Theorem 1.1 and all of Section 6 depend on this scalar-multiple statement, this is a load-bearing gap. The authors should either supply the missing argument or replace the appeal to [Wen19, Section 5] with a precise, verifiable statement of the exact combinatorial lemma needed, together with a proof or a citation to a published source.","section":"§4.2.2, proof of Theorem 4.15"},{"comment":"The base-case computation establishing (4.43) is central but is written in the style of a 'strategy' rather than a complete proof. In particular, the paragraphs following (4.52)–(4.56) assert that the only surviving terms come from a single long t^{-1}-chain or q^{-1}-chain, and that the other L-shaped terms vanish because α is an r-core; the vanishing argument is described in prose and with Figure 3 rather than as a formal induction on colors. Since this computation proves the base case that determines V(1⊗eα) = Eα⊗eα, I ask the authors to turn this into a complete argument, or to give a precise reference to a published proof. The same request applies to the final cancellation leading to (4.59), where the claim that 'nothing is lost if we expand the poles in positive powers' needs justification.","section":"§4.3.4, base case of Theorem 4.18"}],"minor_comments":[{"comment":"The main theorem is stated only for r>2, but this restriction is not repeated in the statements of the applications in Section 6, such as Theorem 6.1 and Corollary 6.2. A standing hypothesis at the beginning of Section 6 would remove the ambiguity.","section":"§1 and §6"},{"comment":"The paper explicitly says that the r=2 case is expected to hold but requires analogues of [Tsy19] and [Wen19]. Since the title and abstract do not mention the restriction, I recommend stating prominently in the abstract that the results are proved for r>2 and that r=2 remains open.","section":"Footnote 1, §1.2"},{"comment":"There are several typographical slips: the title contains 'WREA TH' and the abstract contains 'wreat h', and Corollary 4.19 has an unmatched parenthesis in the product condition '¯c□=0)'. These should be corrected in the final version.","section":"Title and Corollary 4.19"}],"recommendation":"major_revision","confidential_remarks":"The paper is technically rich and likely correct for r>2 if the missing nesting lemma is supplied. I would encourage the editor to allow a revision rather than reject: the gap is explicit and localized, and the surrounding machinery is credible. However, because the proof relies so heavily on an unpublished preprint by the second author, the revised version should either include the needed combinatorial statements in an appendix or cite a published version."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Colleague,\n\nThe paper claims a wreath analogue of the Garsia–Haiman–Tesler identity: an explicit operator V built from nabla and an Omega/T-term sends Hλ to a delta function Eλ. If right, it gives a compact mechanism for wreath Macdonald reciprocity, evaluation formulas, interpolation, Kostka coefficients, and bispectral series, and proves a conjecture from [AD24]. That is a real dividend, and the r>2 case is new; the r=1 reductions are the known Tesler statements.\n\nThe structure is honest: they adapt [GHT99]'s constant-term/operator framework to the wreath setting, using eigenoperators from quantum toroidal and shuffle algebras. The long constant-term computations in 4.3.4 look like the right kind of work, and the applications in Section 6 are mostly formal once (1.6) is in hand.\n\nWhere it gets soft: Theorem 4.15, which identifies V as a scalar multiple on each Hλ, depends on combinatorial control imported from [Wen19]. At the key nesting step the text reads 'It should then be possible to produce such a µ′.' That is an explicit unproved assertion sitting at the load-bearing point. If that nesting fails, the inclusion V(span{ê_quot(µ)}) ⊂ span{Eµ} is not justified, and Theorem 1.1 is not actually proved. This is not a minor typo; it's a hole in the main theorem. The hole may well be repairable—the rest of the proof has the right shape—but the paper as submitted does not fill it. Also, r=2 is excluded with a hand-wave, and the paper leans heavily on the second author's unpublished preprint [Wen19] plus [OSW22]; that's not a sin, but it raises the cost of verification.\n\nThe good news is there are no fitted parameters, no data massage, and the self-citation is consistent with building on prior work. The paper is not trying to smuggle something past you; the gap is right there in the text.\n\nWho is this for? Specialists in wreath Macdonald theory and quantum toroidal algebras. A serious referee should get this, because the potential payoff is high and the gap is localized. But I would not on present evidence regard Theorem 1.1 as established. The referee should demand a complete proof of the nesting step (or a counterexample) and a solid treatment of r=2 before acceptance. If that is supplied, this becomes a central reference in the area. As it stands, it's a promising preprint with a visible hole.","headline":"Genuinely new wreath Tesler identity with many consequences, but the main theorem has a load-bearing 'It should then be possible' step that leaves it short of a proof.","tokens_in":64586,"tokens_out":2211,"would_cite":false,"duration_ms":22113,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05E05","81R10","33D52","81R12"],"pacs":[],"model":"deepseek-v4-flash","headline":"An explicit operator identity turns wreath Macdonald polynomials into delta functions of the wreath Macdonald pairing, making reciprocity and evaluation results follow from formal manipulations.","keywords":["wreath Macdonald polynomials","Tesler identity","delta function","Macdonald–Koornwinder duality","plethystic Kostka coefficients","quantum toroidal algebra","shuffle algebra","bispectral problem"],"falsifier":"Take $r=3$ and a small partition $\\lambda$ such as $(2,1)$ or $(3,1)$, expand both sides of (1.6) in the multi-Schur basis to finite degree, and check the coefficient of every intermediate partition $\\mu$ in the expansions (4.32)–(4.33): a single $\\mu$ with $\\operatorname{core}(\\mu)=\\operatorname{core}(\\lambda)$ that violates $\\mu\\le_r\\lambda$ in the row-strict case or $\\mu\\ge_r\\lambda$ in the column-strict case would falsify Theorem 4.15 and the explicit identity.","tokens_in":63387,"feed_emoji":"🧮","tokens_out":11989,"duration_ms":110055,"temperature":0.7,"pith_summary":"The paper establishes a wreath analogue of the Tesler identity: for $r > 2$, an explicit operator $V_{\\operatorname{core}(\\lambda)}$ sends each wreath Macdonald polynomial, after a normalisation by a scalar evaluation, to the delta function $E_\\lambda$ of its own partition in the wreath Macdonald pairing. Because a delta function paired with any test function performs a plethystic evaluation at that partition's character data, the identity converts statements about duality and evaluations into formal bookkeeping with the pairing and the operator $V$. From this single mechanism the paper derives Macdonald–Koornwinder duality, evaluation formulas, shifted reciprocity, wreath interpolation polynomials, a plethystic formula for wreath $(q,t)$-Kostka coefficients, and series solutions of the bispectral problem. A sympathetic reader should care because it shows that the classical reciprocity story for ordinary Macdonald polynomials has a uniform, explicit analogue in the wreath setting.","feed_headline":"One operator makes wreath Macdonald polynomials into delta functions","feed_subtitle":"The same identity yields duality, evaluation, and Kostka formulas for rank r>2.","key_machinery":"The load-bearing object is the explicit operator $V_\\alpha$: a product of the wreath nabla $\\nabla_\\alpha$, the plethystic exponential $\\Omega[X^{(0)}/((1-q\\sigma^{-1})(t\\sigma-1))]$, and the translation $T[X^{(0)}]$. The nabla acts diagonally on $H_\\lambda$ with eigenvalues given by products of characters of colour-$0$ boxes, the exponential attaches the partition's character data, and the translation shifts the colour-$0$ variables by $1$; together they reproduce the operator that was used in the $r=1$ Tesler identity, with the core $\\alpha$ encoding the colouring information. The proof's main structural device is a uniqueness statement: $V$ is determined by its commutation with the wreath $\\Delta$ operators and by the base case $V(1\\otimes e_\\alpha)=E_\\alpha\\otimes e_\\alpha$. This uniqueness lets the paper avoid Pieri rules, because the action of higher $\\Delta$ operators on the delta functions can be analysed combinatorially instead.","core_discovery":"The central claim is the identity (1.6): for $r > 2$, with $\\alpha=\\operatorname{core}(\\lambda)$, $$E_\\$\\lambda$ = V_\\$\\alpha$\\!\\left(\\frac{H_\\$\\lambda$}{H_\\$\\lambda$[\\iota D^\\bullet_{w_0\\$\\alpha$}]}\\right), \\qquad V_\\$\\alpha$ := \\nabla_\\$\\alpha$\\,\\$\\Omega$\\!\\left[\\frac{$X^{{(0)}}$}{(1-q\\$sigma^{{-1}}$)(t\\$\\sigma$-1)}\\right] T[$X^{{(0)}}$]\\,\\nabla_\\$\\alpha$,$$ where $E_\\lambda$ is the exponential delta function $\\Omega[\\sum_i X^{(i)}(D^\\bullet_\\lambda/((1-q)(t-1)))^{(i)}]$, $\\nabla_\\alpha$ is the wreath nabla operator, and $H_\\lambda[\\iota D^\\bullet_{w_0\\alpha}]$ is the scalar evaluation that also appears as the eigenvalue of $\\nabla_{\\operatorname{core}(\\lambda)}$ at $H_\\lambda$. The appearance of $w_0\\alpha$ reflects the paper's observation that $\\nabla_\\alpha$ is not self-adjoint for the wreath Macdonald pairing—its adjoint is $\\nabla_{w_0\\alpha}$—which is also responsible for the dual basis $H^\\dagger_\\lambda$. The paper proves the identity by first characterising $V$ through its commutation with wreath $\\Delta$ operators and its base case, then computing the base case by induction, and finally showing $V(H_\\lambda)$ is a scalar multiple of $E_\\lambda$. With (1.6) in hand, the paper obtains the duality, evaluation, interpolation, Kostka, and bispectral results as consequences of formal properties of the pairing.","pith_inferences":["The paper leaves the $r=2$ case open, noting that the quantum toroidal presentation differs; the same commutation–uniqueness strategy looks portable there once the $r=2$ analogues are established, and a direct test would be whether the adjoint relation $\\nabla_\\alpha^\\dagger=\\nabla_{w_0\\alpha}$ survives in that setting.","Because the proof avoids Pieri rules, the identity suggests a template for other eigenoperator-driven families: whenever there is a delta-function pairing and a handful of eigenoperators with the right commutation relations, a Tesler-type identity should yield reciprocity statements even without an explicit Pieri calculus.","The plethystic Kostka formula is effectively an algorithm: the quantity $k^\\alpha_{\\vec\\gamma_{>1}}[\\iota D^\\bullet_\\mu]$ can be computed by commuting operators, so comparing its output with direct multi-Schur expansions for small $r=3$, $n\\le 4$ cases would test both the Kostka formula and the underlying combinatorial lemma at once."],"forward_implications":["Macdonald–Koornwinder duality holds in the wreath setting: for $k\\in\\mathbb{Z}/r\\mathbb{Z}$ and $\\operatorname{core}(\\mu)=w_0\\sigma^{-k}\\operatorname{core}(\\lambda)$, the ratio $H_\\lambda[1+u\\sigma^k\\iota D^\\bullet_\\mu]/\\prod_{\\square\\in\\lambda\\setminus\\operatorname{core}(\\lambda),\\ \\bar c_\\square=k}(1-u\\chi_\\square)$ is symmetric in $\\lambda,\\mu$.","Evaluation formulas follow at the specialisation $\\mu=w_0\\sigma^{-k}\\operatorname{core}(\\lambda)$, giving $H_\\lambda[\\sigma^k\\iota D^\\bullet_{w_0\\sigma^{-k}\\operatorname{core}(\\lambda)}]$ as the product of $(-\\chi_\\square)$ over colour-$k$ boxes, confirming the evaluation conjecture used in [AD24].","Taking $u\\to\\infty$ in the duality gives shifted reciprocity: for $\\operatorname{core}(\\mu)=w_0\\sigma^{-k}\\operatorname{core}(\\lambda)$, $H_\\lambda[\\sigma^k\\iota D^\\bullet_\\mu]/H_\\lambda[\\sigma^k\\iota D^\\bullet_{w_0\\sigma^{-k}\\operatorname{core}(\\lambda)}]=H_\\mu[\\sigma^k\\iota D^\\bullet_\\lambda]/H_\\mu[\\sigma^k\\iota D^\\bullet_{w_0\\sigma^{-k}\\operatorname{core}(\\mu)}]$.","The wreath $(q,t)$-Kostka coefficients have a plethystic formula $K_{\\vec\\gamma,\\mu}=k^\\alpha_{\\vec\\gamma_{>1}}[\\iota D^\\bullet_\\mu]$, giving a Pieri-free route to these coefficients.","Wreath interpolation Macdonald polynomials exist, and the global series $F_\\alpha[X^\\bullet,Y^\\bullet]$ is symmetric under interchange of the two alphabets (with appropriate shifted cores) and satisfies the bispectral eigenfunction equations."],"supporting_citations":[{"why":"Supplies the original Tesler identity and the template for extracting reciprocity from a delta-function operator.","marker":"[GHT99]"},{"why":"Provides the wreath Macdonald eigenbasis, the Delta and adjoint Delta operators, and the strongly row- and column-strict r-tabloidizable combinatorics used in Theorem 4.15.","marker":"[Wen19]"},{"why":"Gives the explicit shuffle-algebra formulas for the column, row, and F0,n eigenoperators that the paper uses to build and compute $V$.","marker":"[OSW22]"},{"why":"Supplies the isomorphism between the Fock representation and the twisted vertex representation, identifying the eigenbasis with wreath Macdonald polynomials.","marker":"[Tsy19]"},{"why":"Establishes the existence of wreath Macdonald polynomials as a basis of $\\Lambda^{\\otimes r}_{q,t}$, the objects to which the identity applies.","marker":"[BF14]"},{"why":"Provides the vertex representation formulas for the quantum toroidal algebra that underlie the action used throughout Sections 3 and 4.","marker":"[Sai98]"},{"why":"Supplies the automorphism that relates the horizontal and vertical Heisenberg subalgebras, used in the construction of the eigenoperators and their adjoints.","marker":"[Mik99]"},{"why":"Provides the shuffle-algebra isomorphism used to compute the action of the Feigin–Tsymbaliuk and eigenoperators on the vertex representation.","marker":"[Neg20]"}],"fun_headline_variants":["Wreath Macdonald to delta via Tesler operator","One Tesler operator unlocks wreath duality","Delta operator flips wreath Macdonald polynomials","Tesler identity powers wreath Macdonald reciprocity"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof rests on a combinatorial control assertion: the partitions produced when $V$ acts on the modified elementary and complete symmetric functions are exactly the strongly row-strict and column-strict tabloidisable ones, and the crucial existence step is marked in the paper by the phrase 'It should then be possible'; if that classification has a gap, the conclusion that $V(H_\\lambda)$ is a scalar multiple of $E_\\lambda$—and with it the Tesler identity—does not follow.","fun_headline_variants_meta":{"raw":{"variants":["Wreath Macdonald to delta via Tesler operator","One Tesler operator unlocks wreath duality","Delta operator flips wreath Macdonald polynomials","Tesler identity powers wreath Macdonald reciprocity"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000178,"raw_usage":{"total_tokens":1319,"prompt_tokens":987,"completion_tokens":332,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":603,"completion_tokens_details":{"reasoning_tokens":275}},"tokens_in":603,"tokens_out":332,"duration_ms":4029,"temperature":1.0,"reasoning_tokens":275,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-16T04:11:41.489081+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take $r=3$ and a small partition $\\lambda$ such as $(2,1)$ or $(3,1)$, expand both sides of (1.6) in the multi-Schur basis to finite degree, and check the coefficient of every intermediate partition $\\mu$ in the expansions (4.32)–(4.33): a single $\\mu$ with $\\operatorname{core}(\\mu)=\\operatorname{core}(\\lambda)$ that violates $\\mu\\le_r\\lambda$ in the row-strict case or $\\mu\\ge_r\\lambda$ in the column-strict case would falsify Theorem 4.15 and the explicit identity.","supporting_citations":[],"review_version":1}