Bouquet-graph identity for topological recursion relations
Bouquet-graph identity for topological recursion relations
Let be a non-negative integer. For , let be the graph with one vertex of genus containing all markings and loops; these are called bouquet type graphs. Define the linear form on polynomials in -classes by
Bouquet-graph conjecture. For any topological recursion relation
where each is a polynomial in -classes, the bouquet-type coefficients satisfy
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
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.