Uniqueness of the loop-graph coefficient in topological recursion relations
Uniqueness of the loop-graph coefficient in topological recursion relations
Let be a non-negative integer and consider a degree topological recursion relation of the shape
where is the stable graph with one genus- vertex equipped with loops and all the markings. Suppose that all omitted graphs have at least two vertices, that there are no classes, and that no genus- vertex carries a monomial in -classes of degree at least for . Uniqueness conjecture. The coefficient 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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.