Uniqueness of the loop-graph coefficient in topological recursion relations

Let gg be a non-negative integer and consider a degree gg topological recursion relation of the shape

0=c(ξΓ0,g,[n]loop)(1)+,0=c\cdot\left(\xi_{\Gamma^\mathrm{loop}_{0,g,[n]}}\right)_*(1)+\cdots,

where Γ0,g,[n]loop\Gamma^\mathrm{loop}_{0,g,[n]} is the stable graph with one genus-00 vertex equipped with gg loops and all the markings. Suppose that all omitted graphs have at least two vertices, that there are no κ\kappa classes, and that no genus-hh vertex carries a monomial in ψ\psi-classes of degree at least h+δh0h+\delta_h^0 for 0hg0\leq h\leq g. Uniqueness conjecture. The coefficient cc must vanish. This is a uniqueness statement for topological recursion relations of the specified shape; the supplied text does not establish its resolution, so its status should be checked.

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.