Pith. sign in

REVIEW 2 major objections 5 minor 35 references

Path operators and $(q,t)$-tau functions

T0 review · 2 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 constructs path operators on $(q,t)$-symmetric functions and proves these operators give a unique PDE characterization of the $(q,t)$-tau function.

desk verdict A substantial (q,t) extension of path operators with a new PDE characterization of a (q,t)-tau function and a fresh proof of a key delta-conjecture result; the main gap is a terse q=t=1 specialization argument that is fixable. read the letter →

arxiv 2506.06036 v1 pith:3CSTRKTV submitted 2025-06-06 math.CO math-phmath.MPmath.QAmath.RT

Houcine Ben Dali , Valentin Bonzom , Maciej Do{l}ęga This is my paper · ORCID
classification math.COmath-phmath.MPmath.QAmath.RT MSC 05E0505E10
keywords pathoperatorssymmetricfunctionsMacdonaldpolynomialsshufflealgebraNegutelementstauextendeddeltaconjecturefunctionalequations
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

The paper constructs a new family of operators on symmetric functions in two parameters $q$ and $t$, one for each alternating lattice path, and proves that a certain $(q,t)$-deformation of the classical hypergeometric tau function is uniquely characterized by a system of partial differential equations built from these operators. The tau function $\tau_G(z,X,Y)$ is the Macdonald-polynomial series that specializes to several known generating functions in enumerative geometry and gauge theory. The operators also give explicit expansions in Schur, monomial, and elementary bases, and yield a new proof of a key reformulation behind the extended delta conjecture. The upshot is that a purely combinatorial structure---paths whose steps alternate up and down---carries enough information to pin down a two-parameter tau function completely.

What carries the argument

The central object is the path operator $R_\beta=\sum_{\gamma\in R_\beta}\mathrm{vw}_\beta(\gamma)\,O_{\gamma_1}\cdots O_{\gamma_{2\ell}}$, where the sum runs over alternating lattice paths staying weakly above a reference path $\gamma_\beta$, each weighted by $(qt)^{\mathrm{ht}_\beta(V)}$ over its valleys, and $O(m)$ is the step operator $(-1)^m e_m[X]$ for $m>0$ and $h^\perp_{-m}[MX]$ for $m<0$. The identity that carries the argument is $R_\beta=[z_1^{\beta_1}\cdots z_\ell^{\beta_\ell}]\,D(z_1)\cdots D(z_\ell)\prod_{i=1}^{\ell-1}(1-qt\, z_{i+1}/z_i)$, where $D(z)=\sum_n R_{(n)}z^n$ is the standard field; this identifies $R_\beta$ with the image of a Negut element under the shuffle-algebra representation. For the tau function, the moving part is the family $A_F^{(\ell)}=\sum_\alpha a_\alpha Q_\alpha$, where $Q_\alpha$ is the reparametrization of $R_\beta$ by distances between decorated particles, along with commutation relations that interpret $\mathrm{ad}_{D_0/M}$ and $\mathrm{ad}_{e_1/M}$ as adding particles or extending steps.

What would settle it

Compute the determinant of the change-of-basis matrix from $\{(-1)^{|\lambda|}a_{F,\lambda}\}_{\lambda\vdash n}$ to the elementary basis for $n\le 3$ as an explicit element of $\mathbb{Q}(q,t)[[U,V]]$; if its denominator vanishes at $q=t=1$ for some $F$ (for instance $G_1=G_2=1$), then the specialization step in the proof of Proposition 3.9 would fail, and a direct check of the PDE system at low degree would be needed to decide whether uniqueness still holds.

Watch

Extended reading notes

Core claim

On the paper's own terms, the central claim is Theorem 1.9: for every $\ell\ge 1$, the identity $z^\ell A_{G_1}^{(\ell)}(X)\cdot \tau_G(z,X,Y)=\bigl(A_{G_2}^{(\ell)}(Y)\bigr)^*\cdot \tau_G(z,X,Y)$ holds, and $\tau_G$ is the only series in $\Lambda^K_X\otimes\Lambda^K_Y[[z]]$ with constant term $1$ satisfying all these equations. The operators $A_F^{(\ell)}$ are sums $\sum_{\alpha\in\mathbb{Z}_{\ge0}^\ell} a_\alpha Q_\alpha$, where $Q_\alpha$ is a path operator written in distance coordinates and $a_\alpha$ are coefficients of $F=G_1$ or $G_2$. The proof of the equations uses the Pieri rule and the Macdonald operator $D_0$ acting on modified Macdonald polynomials; the proof of uniqueness shows that repeated applications of the $A_F^{(\ell)}$ to $1$ produce a basis of the symmetric-function ring. The identification of these operators with path operators is established through commutation relations that add particles to decorated lattice paths, and the same mechanism supplies the new proof of the extended-delta-conjecture key result.

Load-bearing premise

The proof of uniqueness assumes that the rational functions in $q$ and $t$ expressing the products $A_F^{(\lambda_1)}\cdots A_F^{(\lambda_\ell)}\cdot 1$ in the elementary basis can be specialized to $q=t=1$ without poles; if that specialization is not legitimate, the triangularity argument only proves a limit statement and the basis claim over $\mathbb{Q}(q,t)[[U,V]]$ is left open.

Editorial extensions

If this is right

  • If Theorem 1.9 holds, the $(q,t)$-tau function is fully pinned down by the path-operator PDE system together with its constant term, so any series satisfying those equations is automatically $\tau_G$.
  • The explicit Schur, monomial, and elementary expansions in Theorem 1.8 give closed formulas for $R_\beta\cdot 1$ in the classical symmetric-function bases.
  • Because $R_\beta$ equals the shuffle-algebra image of Negut elements, the paper supplies an explicit combinatorial formula for that representation.
  • Theorem 5.1 provides a new proof of the key reformulation [BHM+23a, Theorem 4.4.1] underlying the extended delta conjecture, independent of intermediate elliptic Hall algebra results.
  • For special choices of $G$, the same PDE characterization covers the character-variety generating function, the Whittaker-vector specialization of the deformed Virasoro algebra, and the $(q,t)$-Toda tau function.

Reading between the lines

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

  • If the PDE system is as strong as claimed, one could compute $\tau_G$ coefficient-by-coefficient by solving the linear equations degree by degree, an algorithm that may outperform summing over all partitions for small weights.
  • The distance-sequence bijection $\psi$ is the same combinatorial map used in [BHM+23a], which suggests the path-operator proof strategy may extend to other shuffle-theoretic delta-type conjectures.
  • It remains to be seen whether the operators $A_F^{(\ell)}$ act triangularly on the modified Macdonald basis; if they do, the uniqueness theorem would follow from a more algebraic argument not requiring the $q=t=1$ specialization.
  • One could test whether the functional equations continue to characterize $\tau_G$ when $G$ is a rational weight with zeros or poles, a case the current formal setup excludes but which appears naturally in some geometric specializations.
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

2 major / 5 minor

Summary. The paper introduces path operators acting on symmetric functions with two parameters q and t. For any integer sequence β it defines operators R_β as weighted sums over alternating lattice paths, proves a vertex-operator formula for R_β (Theorem 1.5), identifies R_β with the images of Negut shuffle-algebra elements (Corollary 1.7), and derives Schur/elementary/monomial expansions for R_β · 1 (Corollary 2.7). The paper then defines a G-weighted (q,t)-tau function τ_G(z,X,Y), claims that it satisfies a family of PDEs built from path operators, and asserts that these PDEs characterize τ_G uniquely (Theorems 1.9, 3.4, 3.7). Finally, the path-operator formalism is used to give a new proof of the key reformulation [BHM+23a, Theorem 4.4.1] underlying the extended delta conjecture (Theorem 5.1). The proof is organized so that the combinatorial path-operator results of Sections 2 and 4 feed into the tau-function results of Section 3.

Significance. If the main results are correct, the paper gives a clean combinatorial description of a q,t-deformed tau function and of the relevant shuffle-algebra representation, with explicit expansion formulas and a uniqueness statement for the tau function. The connection to the extended delta conjecture provides an independent verification against a substantial external result. The paper is largely self-contained and the main combinatorial proofs are detailed and inductive. However, the tau-function part contains a load-bearing issue in the proof of the key functional equation, as detailed below, so the advertised characterization and uniqueness are not currently established as written.

major comments (2)
  1. [Section 3.2, Lemma 3.6] The proof of Lemma 3.6 drops the squared norms that appear in Eqs. (18) and (19) and in the definition of τ_G. Writing N_λ = ⟨H_λ,H_λ⟩_*, the correct coefficient identity obtained from the displayed inner products is (G(λ)/N_λ) a^{(2)}_{λ,ξ} = (G(ξ)/N_ξ) a^{(1)}_{λ,ξ}. The lemma as stated concludes a^{(2)}_{λ,ξ} = G(ξ)/G(λ) a^{(1)}_{λ,ξ}, which would require N_λ = N_ξ. This already fails for λ = ∅ and ξ = (1), where N_(1)/N_∅ = -(1-q)(1-t) ≠ 1. Thus the proof of Theorem 3.4 is invalid as written, and since Theorem 3.4 is the functional-equation input to Theorem 1.9, this gap is load-bearing. A repair may be possible by working with normalized Macdonald polynomials or by inserting the appropriate norm factors into the adjoint equation, but the current text does not provide such a repair.
  2. [Section 3.3, Proposition 3.9] The proof of Proposition 3.9 evaluates the matrix M_n at q = t = 1 and uses triangularity with invertible diagonal entries to conclude that det(M_n) is invertible over K = Q(q,t)[[U,V]]. This inference requires that each entry of M_n, which a priori is an element of Q(q,t)[[U,V]], has a well-defined q = t = 1 specialization. Since evaluation at q = t = 1 is not a ring homomorphism on all of Q(q,t), the paper must justify that no poles occur. This is very plausibly true: using Theorem 3.12 and the explicit form of the operators O(m), the coefficients of the operators Q_α are polynomials in q and t. But the manuscript does not state or prove this regularity before performing the specialization, so the basis claim in Proposition 3.9 and the uniqueness theorem depending on it are not fully supported.
minor comments (5)
  1. [Section 2.2, proof of Theorem 1.5] The proof refers to 'Theorem 2.3' when applying Lemma 2.3; the reference should be to the lemma itself.
  2. [Section 3.3, proof of Theorem 3.7] Near the end of the proof, the text says τ(z) is determined by 'the equations Eq. (25)', but Eq. (25) is the path-operator formula of Theorem 3.12; the intended reference is the system of functional equations, Eq. (22).
  3. [Section 4.2, Lemma 4.7 and Section 4.3, Proposition 4.13] The proofs refer to 'Definition 4.4' and 'Theorem 4.7'/'Theorem 4.13' for objects that are numbered as Definition 4.4, Lemma 4.7, and Proposition 4.13; the cross-references should be corrected for readability.
  4. [Section 4.3, Proposition 4.15] The displayed recurrence uses both 'sign(m−α_i−1)' in the statement and 'sign(m−α_i)' in the final formula of the proof; the sign convention and the bounds on r_1,r_2 should be stated consistently.
  5. [Section 5, proof of Theorem 5.1] The proof cites 'Theorem 1.7' for the shuffle-algebra identification used to rewrite the sum of R-operators; the intended statement is Corollary 1.7.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the path-operator identities, functional equations, and uniqueness theorem are derived from explicit definitions through internal inductions, with only contextual self-citations.

full rationale

I walked the derivation chain of the main theorems and found no step where a target result is used as an input or where a fitted parameter is renamed a prediction. Theorem 1.5 is proved by induction from the definition of path operators and the D(z) field expansion, via Proposition 2.2 and Lemma 2.3, and Corollary 1.7 identifies R_beta with the shuffle-algebra element X_beta after establishing the VOA formula, rather than defining R_beta as that image. The (q,t)-tau function is introduced explicitly via modified Macdonald polynomials, and the functional equations in Theorem 3.4 are proved from the Pieri rule and the D0 eigenvalue through Lemma 3.5 and Lemma 3.6, so the equations are not imposed by fiat. The uniqueness theorem (Theorem 3.7) constructs a basis a_{F,lambda} from the same operators, extracts coefficients using the dual basis, and then invokes Theorem 3.4 to identify the forced expansion with tau_G; this identification is legitimate because tau_G itself is independently shown to satisfy the equations. The extended delta application in Theorem 5.1 is a new proof using Theorem 3.12 and coefficient extraction, with BHM+23a cited only for comparison. The only issue worth flagging is that Proposition 3.9 evaluates the basis matrix at q=t=1 and concludes invertibility over K without explicitly proving that every matrix entry has a well-defined q=t=1 limit; this is a fixable regularity gap, not a circular reduction, and it does not consist in assuming the basis statement. Self-citations are contextual and none carries the load of the central claims.

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

No fitted numerical parameters appear. The formal series G(ℏ) is an arbitrary input, not fitted. The paper relies on standard Macdonald polynomial theory and shuffle algebra results, all cited from the literature. No new physical entities are postulated.

assumptions (4)
  • standard math Macdonald polynomial theory: Pieri rule, D0 eigenvalue, orthogonality and Cauchy identity (Theorem 3.1, Eqs. 18-19).
    Invoked throughout Section 3 to derive the functional equations and orthogonality relations. These are established results from [Mac95] and [GHT99].
  • domain assumption Shuffle algebra representation and Negut elements (Definition 1.6, Corollary 1.7).
    The paper relies on the representation of the shuffle algebra on symmetric functions and the fact that Negut elements are well-defined in the shuffle algebra. Cited to [Neg14], [FHH+09], [FT11].
  • standard math Vertex operator commutation relation ω(z1/z2) D(z1)D(z2) = ω(z2/z1) D(z2)D(z1) (Eq. 4).
    This relation from [GHT99] is the basis for the VOA expression for path operators in Theorem 1.5 and for normal ordering in Section 2.4.
  • domain assumption Field property of D(z) and well-definedness of infinite products of operators (Remark 1.3).
    The paper proves the field property for D(z) and shows R_β is well-defined by finite annihilation on each homogeneous component. This is background vertex algebra formalism from [Kac17].

how reviews work

0 comments
Cite this review

Pith. "Pith review of Path operators and $(q,t)$-tau functions." pith.science (2026). https://pith.science/paper/3CSTRKTV

@misc{pith2026250606036,
  author       = {Pith},
  title        = {Pith review of: Path operators and $(q,t)$-tau functions},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/3CSTRKTV}},
  note         = {Machine review of arXiv:2506.06036}
}
abstract

We construct a new class of operators that act on symmetric functions with two deformation parameters $q$ and $t$. Our combinatorial construction associates each operator with a specific lattice path, whose steps alternate between moving up and down. We demonstrate that positive linear combinations of these operators are the images of Negut elements via a representation of the shuffle algebra acting on the space of symmetric functions. Additionally, we provide a monomial, elementary, and Schur symmetric function expansion for the symmetric function obtained through repeated applications of the path operators on $1$. We apply path operators to investigate a $(q,t)$-deformation of the classical hypergeometric tau functions, which generalizes several important series already present in enumerative geometry, gauge theory, and integrability. We prove that this function is uniquely characterized by a family of partial differential equations derived from a positive linear combination of path operators. We also use our operators to offer a new, independent proof of the key result in establishing the extended delta conjecture of Haglund, Remmel, and Wilson.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

35 extracted references · 23 canonical work pages

  1. [1]

    Valentin Bonzom, Guillaume Chapuy, S\' e verin Charbonnier, and Elba Garcia-Failde, Topological recursion for O rlov- S cherbin tau functions, and constellations with internal faces , Comm. Math. Phys. 405 (2024), no. 8, Paper No. 189, 53. 4779558

    work page 2024

  2. [2]

    Theory 5 (2025), no

    Houcine Ben Dali, Differential equations for the series of hypermaps with control on their full degree profile, Comb. Theory 5 (2025), no. 1, Paper No. 18, 46. 4882082

    work page 2025

  3. [3]

    Boris Bychkov, Petr Dunin-Barkowski, Maxim Kazarian, and Sergey Shadrin, Topological recursion for Kadomtsev-Petviashvili tau functions of hypergeometric type , Preprint arXiv:2012.14723, 2020

    arXiv 2012

  4. [4]

    Houcine Ben Dali and Maciej Do e ga, Positive formula for Jack polynomials, Jack characters and proof of Lassalle's conjecture , Preprint arXiv:22305.07966, 2023

    arXiv 2023

  5. [5]

    Jean-Emile Bourgine and Alexandr Garbali, A (q, t) -deformation of the 2d T oda integrable hierarchy , Comm. Math. Phys. 405 (2024), no. 9, Paper No. 204, 47. 4788284

    work page 2024

  6. [6]

    Seelinger, A proof of the extended delta conjecture, Forum Math

    Jonah Blasiak, Mark Haiman, Jennifer Morse, Anna Pun, and George H. Seelinger, A proof of the extended delta conjecture, Forum Math. Pi 11 (2023), Paper No. e6, 28. 4553915

    2023

  7. [7]

    Pi 11 (2023), Paper No

    , A shuffle theorem for paths under any line, Forum Math. Pi 11 (2023), Paper No. e5, 38. 4553914

    work page 2023

  8. [8]

    Guillaume Chapuy and Maciej Do e ga, Non-orientable branched coverings, b - H urwitz numbers, and positivity for multiparametric J ack expansions , Adv. Math. 409 (2022), no. part A, Paper No. 108645, 72. 4477016

    2022

Show all 35 references
  1. [9]

    Probab., 2023

    Cesar Cuenca, Maciej Do e ga, and Alexander Moll, Universality of global asymptotics of Jack-deformed random Young diagrams at varying temperatures , Preprint arXiv:2304.04089 to appear in Ann. Probab., 2023

    2023

  2. [10]

    Nitin Chidambaram, Maciej Do e ga, and Kento Osuga, b -Hurwitz numbers from Whittaker vectors for W -algebras , Preprint arXiv:2401.12814, 2024

    K. Nitin Chidambaram, Maciej Do e ga, and Kento Osuga, b -Hurwitz numbers from Whittaker vectors for W -algebras , Preprint arXiv:2401.12814, 2024

    2024 arXiv

  3. [11]

    , b -Hurwitz numbers from refined topological recursion , Preprint arXiv:2412.17502, 2024

    2024

  4. [12]

    87, Cambridge University Press, Cambridge, 2016, A first course in Hurwitz theory

    Renzo Cavalieri and Eric Miles, Riemann surfaces and algebraic curves, London Mathematical Society Student Texts, vol. 87, Cambridge University Press, Cambridge, 2016, A first course in Hurwitz theory. 3585685

    2016

  5. [13]

    Bertrand Eynard, Motohico Mulase, and Bradley Safnuk, The L aplace transform of the cut-and-join equation and the B ouchard- M ari\ n o conjecture on H urwitz numbers , Publ. Res. Inst. Math. Sci. 47 (2011), no. 2, 629--670. 2849645

    2011

  6. [14]

    Feigin, K

    B. Feigin, K. Hashizume, A. Hoshino, J. Shiraishi, and S. Yanagida, A commutative algebra on degenerate CP ^1 and M acdonald polynomials , J. Math. Phys. 50 (2009), no. 9, 095215, 42. 2566895

    2009

  7. [15]

    B. L. Feigin and A. I. Tsymbaliuk, Equivariant K -theory of H ilbert schemes via shuffle algebra , Kyoto J. Math. 51 (2011), no. 4, 831--854. 2854154

    2011

  8. [16]

    A. M. Garsia, M. Haiman, and G. Tesler, Explicit plethystic formulas for M acdonald q,t - K ostka coefficients , vol. 42, 1999, The Andrews Festschrift (Maratea, 1998), pp. Art. B42m, 45. 1701592

    1999

  9. [17]

    I. P. Goulden and D. M. Jackson, The KP hierarchy, branched covers, and triangulations , Adv. Math. 219 (2008), no. 3, 932--951. 2442057

    2008

  10. [18]

    Guay-Paquet and J

    M. Guay-Paquet and J. Harnad, Generating functions for weighted H urwitz numbers , J. Math. Phys. 58 (2017), no. 8, 083503, 28. 3683833

    2017

  11. [19]

    Tam\' a s Hausel, Emmanuel Letellier, and Fernando Rodriguez-Villegas, Arithmetic harmonic analysis on character and quiver varieties, Duke Math. J. 160 (2011), no. 2, 323--400. 2852119

    2011

  12. [20]

    Haglund, J

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

    2018

  13. [21]

    19, Springer, Cham, 2017, pp

    Victor Kac, Introduction to vertex algebras, P oisson vertex algebras, and integrable H amiltonian PDE , Perspectives in L ie theory, Springer INdAM Ser., vol. 19, Springer, Cham, 2017, pp. 3--72. 3751122

    2017

  14. [22]

    M. E. Kazarian and S. K. Lando, An algebro-geometric proof of W itten's conjecture , J. Amer. Math. Soc. 20 (2007), no. 4, 1079--1089. 2328716

    2007

  15. [23]

    Michel Lassalle, A positivity conjecture for J ack polynomials , Math. Res. Lett. 15 (2008), no. 4, 661--681. 2424904

    2008

  16. [24]

    I. G. Macdonald, Symmetric functions and H all polynomials , second ed., Oxford Mathematical Monographs , The Clarendon Press Oxford University Press, New York, 1995, With contributions by A. Zelevinsky, Oxford Science Publications. 1354144

    1995

  17. [25]

    Alexander Moll, Gaussian Asymptotics of Jack Measures on Partitions from Weighted Enumeration of Ribbon Paths , Int. Math. Res. Not. IMRN (2023), no. 3, 1801--1881

    2023

  18. [26]

    Andrei Negut, The shuffle algebra revisited, Int. Math. Res. Not. IMRN (2014), no. 22, 6242--6275. 3283004

    2014

  19. [27]

    Methods Appl

    Maxim Nazarov and Evgeny Sklyanin, Integrable hierarchy of the quantum B enjamin- O no equation , SIGMA Symmetry Integrability Geom. Methods Appl. 9 (2013), Paper 078, 14. 3141546

    2013

  20. [28]

    , Lax operator for M acdonald symmetric functions , Lett. Math. Phys. 105 (2015), no. 7, 901--916. 3357984

    2015

  21. [29]

    Andrei Okounkov, Random matrices and random permutations, Internat. Math. Res. Notices (2000), no. 20, 1043--1095. 1802530

    2000

  22. [30]

    , Toda equations for H urwitz numbers , Math. Res. Lett. 7 (2000), no. 4, 447--453. 1783622 (2001i:14047)

    2000

  23. [31]

    Okounkov and R

    A. Okounkov and R. Pandharipande, Gromov- W itten theory, H urwitz theory, and completed cycles , Ann. of Math. (2) 163 (2006), no. 2, 517--560. 2199225

    2006

  24. [32]

    A. Yu. Orlov and D. M. Scherbin, Fermionic representation for basic hypergeometric functions related to Schur polynomials , Preprint arXiv:nlin/0001001, 2000

    2000 arXiv

  25. [33]

    Methods Appl

    Giulio Ruzza, Jacobi beta ensemble and b - H urwitz numbers , SIGMA Symmetry Integrability Geom. Methods Appl. 19 (2023), Paper No. 100. 4679258

    2023

  26. [34]

    Schiffmann and E

    O. Schiffmann and E. Vasserot, Cherednik algebras, W -algebras and the equivariant cohomology of the moduli space of instantons on A ^2 , Publ. Math. Inst. Hautes \' E tudes Sci. 118 (2013), 213--342. 3150250

    2013

  27. [35]

    Shintarou Yanagida, Whittaker vector of deformed V irasoro algebra and M acdonald symmetric functions , Lett. Math. Phys. 106 (2016), no. 3, 395--431. 3462034

    2016

Pith tools

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