Bouquet-graph identity for topological recursion relations

Let gg be a non-negative integer. For hgh\leq g, let Γh,gh,[n]loop\Gamma^\mathrm{loop}_{h,g-h,[n]} be the graph with one vertex of genus hh containing all markings and ghg-h loops; these are called bouquet type graphs. Define the linear form F\mathcal F on polynomials in ψ\psi-classes by

F(i=1nψiki)=i=1n1(2ki+1)!!.\mathcal F\left(\prod_{i=1}^n\psi_i^{k_i}\right)=\prod_{i=1}^n\frac{1}{(2k_i+1)!!}.

Bouquet-graph conjecture. For any topological recursion relation

Γ(ξΓ)(cΓ)=0,\sum_\Gamma(\xi_\Gamma)_*(c_\Gamma)=0,

where each cΓc_\Gamma is a polynomial in ψ\psi-classes, the bouquet-type coefficients satisfy

h=0g8hF(cΓh,gh,[n]loop)=0.\sum_{h=0}^g8^{-h}\mathcal F\left(c_{\Gamma^\mathrm{loop}_{h,g-h,[n]}}\right)=0.

This is stated as a strengthening of an earlier conjecture and theorem concerning bouquet coefficients; the supplied text gives no resolution evidence.

Sources & referencesView supporting material

Primary source

Felix Janda and Xin Wang, “Structures in topological recursion relations”, arXiv:2601.20673 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.