{"id":"e3dd074c-ce33-4a23-a0e2-5ce8df806d19","arxiv_id":"2412.01938","paper_version":2,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"Explicit eigenvalues and partial eigenvalue sums are derived for Heckman-Polychronakos operators on Jack-type polynomial spaces.","lead":"This paper works out the eigenvalues of Heckman-Polychronakos operators, a family of commuting differential-difference operators tied to Jack polynomials. The authors give explicit formulas for symmetric and skew-symmetric eigenfunctions and for sums of eigenvalues in the general case.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 5.6 is false for |A|=1: χτ[A;n] should equal p−1, not p−1−1/n_a, so the advertised explicit evaluation for τ=(N−1,1) is incorrect.","rationale":"The reader's weakest_assumption concerned self-adjointness and θ≥0, but I find a more concrete and checkable flaw: Theorem 5.6, which is advertised as making the τ=(N−1,1) case fully explicit, is false for singleton subsets A. This matters because Theorem 5.4's k=1 term uses exactly those values, so any application of (28) to the standard isotype yields incorrect partial sums. The main framework, including Theorems 3.1 and 5.4, appears sound: Theorem 3.1 has independent support from the generating function identity (7), and the N=3 example checks against Theorem 5.1 for the sums. The error is localized and easily repairable, so I would not reject the paper outright, but acceptance should be conditional on correcting Theorem 5.6 or explicitly restricting it to |A|≥2 and supplying the correct singleton value. My disagreement with the reader is not about the overall quality but about which assumption is the load-bearing risk; the self-adjointness concern is a limitation while the Theorem 5.6 issue is a stated falsehood.","tokens_in":20128,"tokens_out":49263,"duration_ms":424282,"concrete_test":"Directly enumerate (21) for N=4, τ=(3,1), n=(2,2), A={1}: the stabilizer S_2×S_2 has elements (id,id), ((12),id), (id,(12)), ((12),(12)), with χτ values 3, 1, 1, −1, so the average is 1=p−1, whereas (28) gives 2−1−1/2=1/2. Also test the distinct case n=(1,1,1), |A|=1: (28) gives N−2, while χτ[A;n]=χτ(id)=N−1 by definition. Either check settles that Theorem 5.6 needs correction or a |A|≥2 restriction.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The weakest point I find is not the θ≥0 completeness assumption but a false stated theorem. In definition (21), for |A|=1 the cycle c is the identity, so χτ[A;n] is the average of χτ over the stabilizer S_{n_1}×...×S_{n_p}. For τ=(N−1,1), χτ(g)=fix(g)−1, and the average number of fixed points is Σ_a n_a·(1/n_a)=p, hence χτ[A;n]=p−1 for every singleton A. Theorem 5.6 instead gives p−1−1/n_a. The error enters its proof: the factor 1_{q∈A}(n_q−1) assumes each block in A has exactly one element moved by c, which is true only for |A|≥2; for |A|=1, c=id and all n_q elements are fixed. Because the k=1 term appears in Theorem 5.4, substituting (28) into (23) gives wrong partial sums for τ=(N−1,1). Concretely, for N=4, n=(2,2), τ=(3,1), λ=(a,a,b,b), m=1, the trace of P_1 on V_{λ;τ} is 3(2a+2b+6θ)−θ·6=6a+6b+12θ, while the k=1 term computed with (28) gives 3a+3b+6θ. The fix is to replace the singleton value by p−1, or to state (28) only for |A|≥2, but as written the theorem is false.","agreement_with_reader":"disagree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies the Heckman–Polychronakos operators P_m = sum_{i=1}^N (x_i D_i)^m acting on polynomials in N variables. It states an explicit formula for their eigenvalues on Jack symmetric polynomials (Theorem 3.1), a classification of polynomial eigenfunctions by the isotype of their leading homogeneous component (Theorem 4.3), and trace formulas for sums of eigenvalues over isotypic components of general polynomial eigenfunctions (Theorems 5.1 and 5.4). It also gives explicit character evaluations for the isotype τ=(N−1,1) (Theorem 5.6), a complete eigenvalue list in the two-block case (Corollary 5.7), and an illustrative N=3 example.","tokens_in":20436,"tokens_out":24904,"duration_ms":197694,"significance":"If the main results are correct, the paper provides closed-form spectral data for an important family of commuting differential-difference operators, replacing previously unavailable eigenvalue information with explicit formulas. The derivations are self-contained and parameter-free: eigenvalues are obtained from the operator definition via triangularity, trace identities, and representation-theoretic character sums, with no fitted constants and no reduction to known predictions. The concrete formulas for Jack polynomials and the partial-sum identities for general eigenfunctions are falsifiable and readily testable numerically. The classification theorem is structural and likely to be useful in integrable probability. The main caveats are the incorrect singleton case in Theorem 5.6 and the θ≥0 hypothesis in the completeness proof.","major_comments":[{"comment":"The formula (28) is false when |A|=1. In definition (21), for |A|=1 the cycle c is the identity permutation, so χτ[A;n] is the average of χτ over the Young subgroup S_{n_1}×...×S_{n_p}; for τ=(N−1,1), χτ(g)=fix(g)−1, and the average number of fixed points is sum_{q=1}^p n_q(1/n_q)=p, giving χτ[A;n]=p−1, whereas (28) gives p−1−1/n_a. The proof mis-counts the fixed points of c: when |A|=1, c fixes all n_q elements in the block rather than n_q−1. Because the k=1 term in Theorem 5.4 involves singleton A, the advertised explicit evaluation for τ=(N−1,1) is incorrect as stated. Please restrict (28) to |A|≥2 and state the singleton value separately, or correct the formula.","section":"§5.3, Theorem 5.6"},{"comment":"The proof of Theorem 4.3 uses Lemma 4.7, which assumes θ≥0, but Theorem 4.3 is stated without this hypothesis (the paper says θ is either a formal variable or a positive number). The completeness assertion 'there are no other polynomial eigenfunctions' is therefore not established for formal or negative θ, and the eigenvalue-sum statements in Theorems 5.1 and 5.4 inherit this gap. Please either state these results with θ≥0 explicitly, or supply an algebraic (non-self-adjoint) argument covering the formal-θ case and clarify which statements hold in which regime.","section":"§4, Theorem 4.3 and §5"}],"minor_comments":[{"comment":"The displayed chain contains an incorrect intermediate product: ∏_{i=1}^N (1−θz)/(1−ℓ_i z) is not equal to 1−θz∑ eig_m z^m. The correct identity is 1−θz∑ eig_m z^m = ∏_{i=1}^N (1 − θz/(1−ℓ_i z)) = ∏_{i=1}^N (1−(ℓ_i+θ)z)/(1−ℓ_i z). Please correct the first product.","section":"§3, Proposition 3.2, Eq. (7)"},{"comment":"The N=3 eigenvalue formula (32) is said to be obtained by direct diagonalization, but the diagonalization is not shown; since this is an illustrative example rather than a main result, a brief computational note would be sufficient for verification.","section":"§6, Eq. (32)"},{"comment":"The notation χτ((1,2,...,k)) has an extra closing parenthesis after the cycle; the same typo recurs in the sentence following (13).","section":"§5.1, Eq. (13)"},{"comment":"Please correct minor typographical issues: '[Mac95, Chaprer VI]' should be 'Chapter VI', and 'CN = C[x1, x2 . . . , xN]' should be set as C[x_1,...,x_N].","section":"Throughout"}],"recommendation":"major_revision","confidential_remarks":"The false formula in Theorem 5.6 is localized and does not appear to affect the central trace formulas (Theorems 5.1 and 5.4) or the Jack eigenvalue formula; it is a fixable error. The θ≥0 point is a hypothesis gap rather than an algebraic error. I see no reason to doubt the main results, and the manuscript should be resubmitted after the stated revisions."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"First: the stress-test note is correct. Theorem 5.6 is false for |A|=1. When |A|=1 the cycle c in (21) is the identity, so χτ[A;n] is an average of χτ over the Young subgroup S_n1×...×S_np. For τ=(N−1,1), χτ(g)=fix(g)−1, and the average number of fixed points is Σ n_i·(1/n_i)=p, so χτ[A;n]=p−1. The theorem's value p−1−1/n_a is off by 1/n_a. The error is in the proof: the factor 1_{q∈A}(n_q−1) counts n_q−1 fixed elements in a selected block, which holds only when |A|≥2. For |A|=1, all n_q elements are fixed. Substituting (28) into Theorem 5.4 gives wrong partial sums for τ=(N−1,1). I checked the N=4, n=(2,2) example in the note; the numbers line up. So this is a real false theorem, not a typo.\n\nNow the credit. The paper does something genuinely new: Theorem 3.1 gives explicit closed-form eigenvalues of Heckman-Polychronakos operators on Jack polynomials, which prior literature did not have. Theorem 4.3 gives a full classification of polynomial eigenfunctions by (λ,τ,i), and Theorem 5.4 is an attractive character-averaging formula for sums of eigenvalues. The derivations are mostly self-contained trace/character computations, and they cite the standard representation-theory facts appropriately. The generating-function reformulation in Proposition 3.2 is elegant.\n\nThe other soft spot mentioned by the reader, the unshown diagonalization behind (32), is minor: it is a computational example, and the formula is independently checkable. The dependence on Lemma 4.7's self-adjointness for θ≥0 is acceptable for the completeness statement, though not novel.\n\nSo where does this leave the paper? The central formulas are likely correct, but the advertised explicit evaluation for the (N−1,1) isotype is wrong. The fix is simple—replace the singleton value by p−1, or restrict (28) to |A|≥2—and Corollary 5.7's p=2 case appears unaffected. A serious referee should send this to review and require that correction. I would not cite the current version, but I would cite a corrected one if I worked in this area. The reader's ACCEPT is too generous as it stands; my own verdict would be major revision.","headline":"The central spectral formulas are new and mostly sound, but Theorem 5.6 is false for singleton A, so the advertised (N−1,1) evaluation needs correction.","tokens_in":20966,"tokens_out":8451,"would_cite":false,"duration_ms":65640,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05E05","33C52","20C30"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper gives explicit closed-form formulas for the eigenvalues of the Heckman-Polychronakos operators and classifies all their polynomial eigenfunctions.","keywords":["Heckman-Polychronakos operators","Dunkl operators","Jack polynomials","Calogero-Moser-Sutherland model","eigenvalue formulas","symmetric group characters","isotypic components","integrable probability"],"falsifier":"For N=3, theta=1, lambda=(2,1,0), tau=(2,1), m=2, compute the trace identity by diagonalizing P_2 restricted to the isotypic component V_{lambda,tau} of the degree-3 space and compare with the character formula on the right-hand side of the eigenvalue-sum theorem. A mismatch would falsify the theorem; since the proof reduces all spectral data to this trace, a single clean numerical computation settles it.","tokens_in":19921,"feed_emoji":"🧮","tokens_out":8815,"duration_ms":75242,"temperature":0.7,"pith_summary":"The paper works out the spectrum of the Heckman-Polychronakos operators P_m = sum_i (x_i D_i)^m, a family of commuting differential-difference operators tied to the Calogero-Moser-Sutherland model. It establishes explicit closed-form formulas for their eigenvalues on symmetric Jack polynomials, explicit formulas for the sums of eigenvalues on every isotypic component of general polynomial eigenfunctions, and a complete classification of those eigenfunctions by a partition, an irreducible representation of the symmetric group, and an index. If correct, this makes the spectral data of these operators fully explicit, where previously even basic eigenvalue formulas were missing. That matters because these operators are the discrete Jack side of power sums of Dunkl operators used in random matrix theory and integrable probability.","feed_headline":"Closed-form spectra for Heckman-Polychronakos operators","feed_subtitle":"Eigenvalues reduce to symmetric-group characters and complete homogeneous polynomials.","key_machinery":"The key machinery is the action of the basic building block x_i D_i, whose top-degree part is the finite-dimensional operator T_i of (9), acting on the space V_lambda spanned by monomials whose degree sequence rearranges to $\\lambda$. Lemma 4.6 shows P_m is triangular with respect to dominance order: the leading part of P_m[x^gamma] is (T_1^m + ... + T_N^m)[x^gamma]. Lemma 4.7 proves that x_i D_i is self-adjoint for $\\theta$ >= 0 with respect to a torus inner product, yielding a complete joint eigenbasis. The trace of the isotypic projection of (T_1^m + ... + T_N^m) over V_lambda then converts eigenvalue sums into characters of the symmetric group; the final formula packages the computation in terms of averaged characters and complete homogeneous polynomials. The two-block specialization uses the Gelfand pair structure of (S_N, S_{N-eta} x S_eta) and spherical functions to produce explicit single eigenvalues.","core_discovery":"The central discovery is that the Heckman-Polychronakos operators have a fully explicit spectrum. For a Jack polynomial J_lambda with $\\lambda$ = (lambda_1 >= ... >= lambda_N >= 0), the eigenvalue of P_m is eig_m($\\lambda$) = $h_m^{{(1)}}$(ell) - $\\theta$ h_{m-1}^{(2)}(ell) + ... + (-$\\theta$)^{N-1} h_{m+1-N}^{(N)}(ell), where ell_i = lambda_i + $\\theta$(N-i) and $h_m^{{(r)}}$ are sums of complete homogeneous symmetric polynomials over r-element subsets; equivalently, the generating function (1 - $\\theta$ z) sum_m eig_m($\\lambda$) z^m = prod_{i=1}^N (1-(ell_i+$\\theta$)z)/(1-ell_i z) holds. More generally, every polynomial eigenfunction is homogeneous, has leading part in a single isotypic component of the symmetric-group action, and all polynomial eigenfunctions are labeled by triples ($\\lambda$, tau, i). The sum of the eigenvalues over the isotypic component is given by a formula involving characters of the symmetric group evaluated on cycles and averaged over Young subgroups. The paper also gives fully explicit eigenvalues in the two-block case $\\lambda$ = ($a^{{N-eta}}$, b^eta), where the eigenvalues are multiplicity-free and read off from a hypergeometric evaluation.","pith_inferences":["An implied next step, not taken in the paper, is to push the generating function to a large-N limit and compare with the high-temperature beta-ensemble asymptotics that motivated the work.","The character sums in the general eigenvalue formula look like the ingredients of a central limit theorem for Jack-deformed random Young diagrams; the paper does not develop the fluctuations.","The classification by (lambda, tau, i) suggests the polynomial ring carries a hidden graded decomposition by symmetric-group isotypic components; a q-deformation to Macdonald level is not attempted, but the structure is coherent enough to support one."],"forward_implications":["Jack-polynomial eigenvalues of P_m can now be computed to any order from the generating function without solving an eigenproblem.","Skew-symmetric eigenfunctions, and more generally eigenfunctions with any symmetric-group isotype, have eigenvalue sums given by an explicit character formula.","For the two-block case lambda = (a^{N-eta}, b^eta), all individual eigenvalues are explicit and the multiplicities match the branching of (S_N, S_{N-eta} x S_eta), giving a complete spectral picture for that family.","The triangularity lemma plus the complete eigenbasis means every polynomial can be expanded in joint eigenfunctions of all P_m, making P_m a fully diagonalizable commuting family.","These explicit spectra supply the discrete-side observable data needed to run asymptotic analyses of power sums of Dunkl operators in integrable probability."],"supporting_citations":[{"why":"Introduces the Heckman-Polychronakos operators and their link to the trigonometric Calogero-Moser-Sutherland Hamiltonian, the operators whose eigenvalues the paper computes.","marker":"[Hec91]"},{"why":"Gives the exchange-operator construction of the same family and establishes the operators P_m as objects of study.","marker":"[Pol92]"},{"why":"Develops Jack symmetric functions and their eigenfunction property for these operators, the starting point of Theorem 3.1.","marker":"[Sta89]"},{"why":"Standard reference for Jack polynomials, complete homogeneous symmetric functions, and symmetric-group character formulas used throughout.","marker":"[Mac95]"},{"why":"Introduces Dunkl operators, whose power sums define the Heckman-Polychronakos operators.","marker":"[Dun89]"},{"why":"Provides the integral-kernel scalar product with respect to which x_i D_i is self-adjoint, used in Lemma 4.7 for completeness.","marker":"[Dun91]"},{"why":"Supplies the isotypic projection formula used to convert eigenvalue sums into symmetric-group characters.","marker":"[Ser77]"}],"fun_headline_variants":["Explicit spectra for Heckman-Polychronakos operators","Heckman-Polychronakos eigenvalues in closed form","Closed-form eigenvalues for Heckman-Polychronakos","Exact eigenvalues for Heckman-Polychronakos operators","Heckman-Polychronakos: closed-form spectrum"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The completeness of the eigenfunction classification rests on the self-adjointness of the operators x_i times the Dunkl derivative for theta >= 0; if theta is negative, the proof does not establish that every polynomial eigenfunction is captured.","fun_headline_variants_meta":{"raw":{"variants":["Explicit spectra for Heckman-Polychronakos operators","Heckman-Polychronakos eigenvalues in closed form","Closed-form eigenvalues for Heckman-Polychronakos","Exact eigenvalues for Heckman-Polychronakos operators","Heckman-Polychronakos: closed-form spectrum"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000553,"raw_usage":{"total_tokens":2610,"prompt_tokens":896,"completion_tokens":1714,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":512,"completion_tokens_details":{"reasoning_tokens":1639}},"tokens_in":512,"tokens_out":1714,"duration_ms":11475,"temperature":1.0,"reasoning_tokens":1639,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-11T23:59:56.104744+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"For N=3, theta=1, lambda=(2,1,0), tau=(2,1), m=2, compute the trace identity by diagonalizing P_2 restricted to the isotypic component V_{lambda,tau} of the degree-3 space and compare with the character formula on the right-hand side of the eigenvalue-sum theorem. A mismatch would falsify the theorem; since the proof reduces all spectral data to this trace, a single clean numerical computation settles it.","supporting_citations":[],"review_version":1}