Pith. sign in

REVIEW 3 major objections 4 minor 32 references

This paper claims that the branching factors for non-symmetric Macdonald polynomials are q-Pochhammer products, and their analytic continuation gives Cherednik eigenfunctions at arbitrary eigenvalues.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

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

T0 review · deepseek-v4-flash

2026-08-02 07:39 UTC pith:VAL3FTHE

load-bearing objection Solid N=2 construction, but the generic-N claims — the factorized branching formula and the missing eigenfunction combination — are asserted rather than proven. the 3 major comments →

arxiv 2607.09203 v2 pith:VAL3FTHE submitted 2026-07-10 hep-th math-phmath.MPmath.QA

Cherednik integrable system: eigenfunctions at generic eigenvalues

A. Mironov , A. Morozov , A. Popolitov This is my paper
classification hep-th math-phmath.MPmath.QA MSC 33D5205E05 PACS 02.30.Ik
keywords Cherednik Hamiltoniansnon-symmetric Macdonald polynomialsskew branching coefficientsq-Pochhammer symbolsNoumi-Shiraishi seriesDAHAuniversal eigenfunctionsintegrable systems
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

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

Non-symmetric Macdonald polynomials are polynomial eigenfunctions of the N-body Cherednik Hamiltonians, but only at discrete eigenvalues labeled by integer compositions. This paper claims that the one-variable branching coefficients that govern how these polynomials grow as the number of variables is increased are factorized products of q-Pochhammer symbols. Because the formula is explicit in the labels, the recursion can be continued to arbitrary complex labels, turning finite polynomials into infinite power series. The paper asserts that these series, organized into N! branches, combine into eigenfunctions of the Cherednik Hamiltonians at arbitrary complex eigenvalues, forming a non-symmetric analogue of the Noumi-Shiraishi universal solution.

Core claim

The central discovery is that the one-variable skew coefficients E_{λ/μ}(1) — the coefficients appearing when a non-symmetric Macdonald polynomial E_λ(x_1,...,x_{N-1},y) is expanded in the basis E_μ(x_1,...,x_{N-1}) — factor into q-Pochhammer products rather than remaining complicated rational functions. The paper writes an explicit closed form, eq. (55), uniform when λ and μ are ordered weak compositions (Young diagrams), with simple correction factors for permutations. Because these factors are explicit analytic functions of the labels, the sums over intermediate compositions can be continued to arbitrary complex λ, converting polynomials into infinite power series. The paper claims that t

What carries the argument

The engine is the branching recursion in the number of variables: E_λ(x_1,...,x_{N-1},y) = Σ_μ E_{λ/μ}(1) y^{|λ|−|μ|} E_μ(x_1,...,x_{N-1}), where the one-variable skew factors E_{λ/μ}(1) are given in eq. (55) as products of q-Pochhammer symbols (x;q)_n = (1−x)(1−xq)···(1−xq^{n−1}) with arguments built from differences of the λ_i, μ_i, and t. A cyclic-shift relation (eq. 31) generates the N! variants of these coefficients for different choices of the distinguished variable. Iterating the recursion expresses any E_λ as a sum over a chain of intermediate weak compositions; under analytic continuation the sum becomes infinite, giving the N! power-series branches.

Load-bearing premise

The load-bearing premise is that the factorized formula (55) is valid for every N, despite being verified only for N=2 and N=3 in this paper; if it fails at some N, the continued-series eigenfunction claim collapses.

What would settle it

For N=4, compute the coefficient E_{λ/μ}(1) for a small case such as λ=(2,2,1,0), μ=(2,1,0) using any independent algorithm for non-symmetric Macdonald polynomials, and compare with formula (55); a single mismatch disproves the universal formula. Alternatively, construct the continued branch (60) for N=3 with a linear combination analogous to (65) and directly evaluate (C_i − q^{λ_i} t^{3−i}) E; a nonzero remainder settles the eigenfunction claim.

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

  • Non-symmetric Macdonald polynomials at any N can be computed by a recursion with explicit factorized coefficients, rather than by solving eigenvalue equations or using plethystic expansions.
  • The analytically continued series supply eigenfunctions of the Cherednik Hamiltonians with arbitrary complex eigenvalues, not just the discrete set labelled by integer compositions.
  • The construction yields a non-symmetric triad: at ordered integer labels the series reduce to non-symmetric Macdonald polynomials, and at t=q^{−m} they reduce to (quasi)polynomial Baker–Akhiezer-type functions.
  • The N! branches are tied by simple permutation formulas, so the universal solution can be viewed either as one multivalued function or as an N!-component vector of independent eigenfunctions.
  • The paper states that the same scheme is expected to extend to twisted Cherednik operators and to DAHA Hamiltonians of other root systems (Koornwinder polynomials).

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • If eq. (55) is correct for all N, it likely provides one of the fastest direct algorithms to generate non-symmetric Macdonald polynomials, because each coefficient is a closed product; a benchmark against existing recursive or combinatorial algorithms would be a useful test.
  • The N!-branch structure points toward an interpretation of the continued series as a function on the Weyl-group orbit of the spectral label, suggesting a link with DAHA intertwiners that the paper does not explore.
  • A similar factorization might hold for the branching coefficients of other DAHA eigenfunctions, such as Koornwinder polynomials; verifying the analogue of eq. (55) would be a direct test.
  • The N=3 case is the first genuinely nontrivial check of the general eigenfunction claim; writing down the explicit linear combination for N=3 (analogous to eq. (65)) is a natural next step.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

3 major / 4 minor

Summary. The paper proposes a recursive construction of non-symmetric Macdonald polynomials E_λ via skew branching coefficients E_{λ/μ}(1) for one distinguished variable. Its main claims are: (i) these coefficients are factorized products of q-Pochhammer symbols for all N (Eq. (55)); (ii) successive branching represents E_λ as finite sums over weak compositions; (iii) analytic continuation in λ turns these sums into N! Noumi-Shiraishi-type power-series branches; and (iv) suitable linear combinations of these branches are eigenfunctions of the Cherednik Hamiltonians with arbitrary complex eigenvalues. Explicit N=2 and N=3 formulas are provided, and an explicit N=2 eigenfunction combination is given. The generic-N eigenfunction construction is explicitly deferred to a forthcoming paper.

Significance. If correct, this would give a useful non-symmetric analogue of the Noumi-Shiraishi construction and a 'non-symmetric triad', with factorized branching coefficients as the central structural insight. The N=2 formulas (40)-(41) and (65) are concrete and checkable, and the N=3 data in §4.2 are extensive. No parameters are fitted and the advertised eigenvalue equations are falsifiable. The main limitation is that the generic-N claims are not proven: Eq. (55) is asserted without derivation, and the N≥3 linear combination of branches is not written down. Because these are exactly the ingredients needed for the central claim, the present text establishes the N=2 case but not the general result.

major comments (3)
  1. [§5, Eq. (55)] The generic-N factorization is introduced with the sentence 'This formula straightforwardly generalizes...' after only the N=2 and N=3 cases. No induction, no derivation from the Knop–Sahi recurrence (31), and no independent verification for N≥4 are provided. Since Eq. (55) is the input for the analytic continuation in §6, Eq. (60), this missing justification is load-bearing. Please supply a proof or a complete N=4 verification for a nontrivial (λ, μ).
  2. [§6, Eq. (60) and Conclusion] For N≥3 the eigenfunction statement is only asserted: 'this branch gives (after taking some linear combination, see an example below) an eigenfunction'; the only example is the N=2 combination (65). The Cherednik Hamiltonians (23)-(24) contain permutations, so branches are coupled; no explicit N=3 (or general) combination is written down, and the Conclusion postpones 'a full list of formulas' to ref. [30], to appear. The arbitrary-eigenvalue claim of the abstract is therefore not established for N≥3.
  3. [§5, Eqs. (57)-(59)] The claimed N! branch structure rests on formulas for a single adjacent transposition. After stating (57), the text notes it 'does not work when one makes already two successive permutations.' No explicit algorithm is given to obtain E_{λ/μ} for general permutations of λ or μ. Without this, the six (or N!) branch series in (60) are not demonstrated to be related in the way required by the linear-combination construction.
minor comments (4)
  1. [§2, end of Section 2] There is a typo 'F orth' for 'Fourth', and the statement 'At N>3, the common interpolation exists for all E_[λ1,λ2,λ3]' appears to concern N=3, not N>3.
  2. [§6, Eq. (65)] The subscript m in E^>_m and E^<_m is not defined; either remove it or explain its meaning.
  3. [§6, Eqs. (61)-(66)] The text shifts λ by half-integer powers of t in (62) and then quotes eigenvalues (66); the relationship between the original λ in (60)/(61) and the shifted parameters used in (65) should be stated explicitly so that the N=2 check is unambiguous.
  4. [Appendix] The tables refer to 'red', 'blue', and 'orange' blocks, but these colors are not visible in monochrome printing and are not otherwise labeled. Please add textual labels or typographic markers.

Circularity Check

1 steps flagged

Load-bearing N=2 eigenfunction combination is deferred to authors' unpublished [30]; for N≥3 the required combination is only asserted — a self-citation/omission gap, not a definitional circularity.

specific steps
  1. self citation load bearing [§6, eqs. (60), (65); Conclusion]
    "this branch gives (after taking some linear combination, see an example below) an eigenfunction of the Cherednik Hamiltonians with the eigenvalues Λ(i)λ = q^{λi}t^{N−i} ... In order to construct eigenfunctions with arbitrary eigenvalues, one has to use the combinations [30]: ... which are eigenfunctions of the Cherednik Hamiltonians with the same eigenvalues ... (66) ... We postpone a full list of formulas as well as a detailed discussion of the structure of triad branches to the forthcoming publication."

    The linear combination (65) is the step that turns the two branch series into genuine Cherednik eigenfunctions; without it, the paper explicitly says the series are 'not eigenfunctions'. This step is not derived in the paper but assigned to [30], an unpublished same-author paper ('to appear'), and no verification is supplied. For N≥3 the analogous combination is not even written: eq. (60) says only 'after taking some linear combination, see an example below', and the example is exclusively N=2. The Conclusion postpones the full formulas to [30]. Hence the arbitrary-eigenvalue claim for generic N is carried by an unverified self-citation and an omitted construction, i.e. a load-bearing self-citation gap, rather than by an equation that reduces to its input.

full rationale

The paper's independent content is real: the factorized skew coefficients (55) are defined from known non-symmetric Macdonald polynomials, explicitly checked at N=2 (eq. 40) and matched to N=3 patterns, and no parameter is fitted to the eigenvalues it claims to predict. Were the analytic continuation and the branch-combination step supplied, this would be a self-contained construction. The circularity concern is confined to the eigenfunction step: at N=2 the eigenfunction combination (65) is imported from ref. [30] (same three authors, 'to appear'); at N≥3 no combination is given, and the Conclusion explicitly defers the full list of formulas. This is a load-bearing self-citation/omission, not a definitional equivalence; hence score 4, not higher. The unproven status of (55) for all N is an inductive gap, which I do not count as circular.

Axiom & Free-Parameter Ledger

0 free parameters · 5 axioms · 0 invented entities

The ledger is dominated by one large ad hoc assumption: that the factorized formula (55) and the permutation relations (57)-(59) are valid for all N. These are not derived; they are inferred from small-N data and asserted. A second ad hoc assumption is the existence of the branch-combination that turns the individual series into eigenfunctions for N≥3. No free parameters are fitted, and no new physical entities are introduced.

axioms (5)
  • domain assumption Non-symmetric Macdonald polynomials E_λ are eigenfunctions of the Cherednik Hamiltonians (23) with eigenvalues (27), and the expansion (28) defines the skew polynomials E_{λ/μ}.
    Standard results from the cited literature [19-21]; invoked throughout the paper, e.g., in §3.2 and §4.
  • ad hoc to paper Formula (55) gives the factorized one-variable skew coefficients E_{λ/μ} for all N when λ, μ are Young diagrams.
    Asserted in §5 as 'straightforwardly generalizes' from N=2,3; no proof supplied. The paper only checks consistency with (40) at N=2.
  • ad hoc to paper The permutation relations (57)-(59) describe the N! branches for arbitrary orderings of λ and μ.
    Stated as 'the general claim' in §5 without proof; the paper notes it fails after two successive permutations.
  • ad hoc to paper The analytically continued infinite series converge as formal power series and, after the appropriate linear combination, solve the Cherednik eigenfunction equations at arbitrary complex λ.
    Shown explicitly only for N=2 via combination (65), which cites ref. [30] 'to appear'; for N≥3 the combination is not specified (§6, eq. 60).
  • standard math Knop-Sahi recurrence (31) from the prior literature [28,29].
    Used to relate the different skew branches (eqs. 32-33) and is a known property of non-symmetric Macdonald polynomials.

pith-pipeline@v1.3.0-alltime-deepseek · 24874 in / 14356 out tokens · 144532 ms · 2026-08-02T07:39:00.054046+00:00 · methodology

0 comments
read the original abstract

Symmetric Macdonald polynomials of $n$ variables provide eigenfunctions of the $N$-body trigonometric Ruijsenaars-Schneider integrable system at particular eigenvalues. In order to construct eigenfunctions with arbitrary eigenvalues, M. Noumi and J. Shiraishi used a recursion in $N$ (branching rule) for the symmetric Macdonald polynomials and analytically continued them. This generated a power series, which is a part of triad (universal solution). In the present paper, we demonstrate that a similar procedure is available for another integrable system, $N$-body Cherednik integrable system inspired by the DAHA of type $A$, which has non-symmetric Macdonald polynomials as its polynomial eigenfunctions. However, in this system, the generic eigenfunction is more complicated: it is not just a simple power series as in the Noumi-Shiraishi case, but has an involved structure with $N!$ branches, each of them being a power series of the Noumi-Shiraishi type. As an illustration, we also provide explicit formulas for particular cases.

Review history (2 revisions) →

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

32 extracted references · 21 linked inside Pith

  1. [1]

    J. Ding, K. Iohara, Lett. Math. Phys.41(1997) 181-193, q-alg/9608002

    Pith/arXiv arXiv 1997

  2. [2]

    K. Miki, J. Math. Phys.48(2007) 123520

    2007

  3. [3]

    Cherednik, IMRN (Duke M.J.)9(1992) 171-180

    I. Cherednik, IMRN (Duke M.J.)9(1992) 171-180

    1992

  4. [4]

    Ruijsenaars, H

    S.N.M. Ruijsenaars, H. Schneider, Ann.Phys. (NY),170(1986) 370 S.N.M. Ruijsenaars, Comm.Math.Phys.110(1987) 191-213

    1986

  5. [5]

    Cherednik,Double affine Hecke algebras, Vol.319, Cambridge University Press, 2005

    I. Cherednik,Double affine Hecke algebras, Vol.319, Cambridge University Press, 2005

    2005

  6. [6]

    Mironov, A

    A. Mironov, A. Morozov, A. Popolitov, arXiv:2512.24811 13

    arXiv

  7. [7]

    Mironov, A

    A. Mironov, A. Morozov, A. Popolitov, Nucl. Phys.B1028(2026) 117513, arXiv:2601.10500

    Pith/arXiv arXiv 2026

  8. [8]

    Mironov, A

    A. Mironov, A. Morozov, A. Popolitov, Phys. Lett.B877(2026) 140457, arXiv:2601.19878

    Pith/arXiv arXiv 2026

  9. [9]

    Mironov, A

    A. Mironov, A. Morozov and A. Popolitov, Phys. Lett.B879(2026) 140592, arXiv:2602.21120

    Pith/arXiv arXiv 2026

  10. [10]

    Kapranov, Algebraic geometry7, J.Math

    M. Kapranov, Algebraic geometry7, J.Math. Sci.84(1997) 1311-1360, alg-geom/9604018

    Pith/arXiv arXiv 1997

  11. [11]

    Burban, O

    I. Burban, O. Schiffmann, Duke Math. J.161(2012) 1171, arXiv:math/0505148

    Pith/arXiv arXiv 2012

  12. [12]

    Schiffmann, J

    O. Schiffmann, J. Algebraic Combin.35(2012) 237-26, arXiv:1004.2575

    Pith/arXiv arXiv 2012

  13. [13]

    Feigin, M

    B. Feigin, M. Jimbo, T. Miwa, E. Mukhin, Commun. Math. Phys.356(2017) 285, arXiv:1603.02765

    Pith/arXiv arXiv 2017

  14. [14]

    Mironov, A

    A. Mironov, A. Morozov, A. Popolitov, JHEP,09(2024) 200, arXiv:2406.16688

    Pith/arXiv arXiv 2024

  15. [15]

    Di Francesco, R

    P. Di Francesco, R. Kedem, Comm. Math. Phys.369(3)(2019) 867-928, arXiv:1704.00154

    Pith/arXiv arXiv 2019

  16. [16]

    Chalykh, M

    O. Chalykh, M. Fairon, J.Geom.Phys.121(2017) 413-437, arXiv:1704.05814

    Pith/arXiv arXiv 2017

  17. [17]

    Mironov, A

    A. Mironov, A. Morozov, A. Popolitov, Phys. Lett.B863(2025) 139380, arXiv:2410.10685

    Pith/arXiv arXiv 2025

  18. [18]

    Chalykh, P

    O. Chalykh, P. Etingof, Advances in Mathematics,238(2013) 246-289, arXiv:1111.0515

    Pith/arXiv arXiv 2013

  19. [19]

    Opdam, Acta Mathematica,175(1)(1995) 75–121

    E.M. Opdam, Acta Mathematica,175(1)(1995) 75–121

    1995

  20. [20]

    Macdonald, Asterisque-Societe Mathematique de France,237(1996) 189-208

    I.G. Macdonald, Asterisque-Societe Mathematique de France,237(1996) 189-208

    1996

  21. [21]

    Cherednik, IMRN,1995(10)(1995) 483, q-alg/9505029

    I. Cherednik, IMRN,1995(10)(1995) 483, q-alg/9505029

    Pith/arXiv arXiv 1995

  22. [22]

    Chalykh, Adv.Math.166(2)(2002) 193-259, math/0212313

    O. Chalykh, Adv.Math.166(2)(2002) 193-259, math/0212313

    Pith/arXiv arXiv 2002

  23. [23]

    Noumi, J

    M. Noumi, J. Shiraishi, arXiv:1206.5364

    Pith/arXiv arXiv

  24. [24]

    Mironov, A

    A. Mironov, A. Morozov, A. Popolitov, Phys. Lett.B869(2025) 139840, arXiv:2411.16517

    Pith/arXiv arXiv 2025

  25. [25]

    Di Francesco, R

    P. Di Francesco, R. Kedem, Selecta Math.30(2024) no.2, 23, arXiv:2112.09798

    Pith/arXiv arXiv 2024

  26. [26]

    Sekiguchi, Publ

    J. Sekiguchi, Publ. RIMS, Kyoto Univ.12(1977) 455-459 A. Debiard, C.R. Acad. Sci. Paris (sir. I)296(1983) 529-532 S.N.M. Ruijsenaars, Comm.Math.Phys.110(1987) 191-213 I.G. Macdonald, Springer Lecture Notes1271(1987) 189-200

    1977

  27. [27]

    Macdonald,Symmetric functions and Hall polynomials, Oxford University Press, 1995

    I.G. Macdonald,Symmetric functions and Hall polynomials, Oxford University Press, 1995

    1995

  28. [28]

    F. Knop, S. Sahi, Invent. Math.128(1997) 9-22, q-alg/9610016

    Pith/arXiv arXiv 1997

  29. [29]

    Haglund, M

    J. Haglund, M. Haiman, N. Loehr, Am.J.Math.130(2)(2008) 359-383, math/0601693

    Pith/arXiv arXiv 2008

  30. [30]

    Mironov, A

    A. Mironov, A. Morozov, A. Popolitov, to appear

  31. [31]

    Bishler, A

    L. Bishler, A. Mironov, A. Popolitov, arXiv:2607.06738 14 8 Appendix: Some explicit expressions Here we sketch some explicit formulas, concerning non-symmetric polynomialsE λ for low levelL:= PN i=1 λi andN. They can turn useful for visualizing the emerging structures and for their future analysis. Level [1]: EL=1 N,1 =E 0,...,0,1 = Ξ0,...,0,0,1| {z } ΞN,...

    Pith/arXiv arXiv

  32. [32]

    01 | {z } k2 0...0 = NX i1 <i2 i1≥k1,i2≥k2 ci1,i2 N,k1,k2 ·Ξ [1,1] i1,i2 (77) N= 2: E12 = Ξ12 N= 3: k1,k2 \ i1,i2 Ξ12 Ξ13 Ξ23 E12 = (13)(23) (12) 32 1 31 1(21) E13 = (12) 21 2 E23 = 1 (78) N= 4: k1,k2 \ i1,i2 Ξ12 Ξ13 Ξ14 Ξ23 Ξ24 Ξ34 E12 = (13)(14)(23)(24) (12)(14)(34) 32 1 (12)(13) 42 1(43) (24)(34) 31 1(21) (23) 41 1(21)(43) c34 4,12 E13 = (12)(14)(34) (...