Gross–Manturov–Tucker's interpolating partial-duality polynomial conjecture
Gross–Manturov–Tucker's interpolating partial-duality polynomial conjecture
Let be a ribbon graph, and let denote its partial- polynomial. A polynomial is odd or even when all terms with nonzero coefficients have, respectively, odd or even degree, and it is interpolating when its support is an integer interval of consecutive integers. Gross–Manturov–Tucker's conjecture. If the partial- polynomial is neither an odd nor an even polynomial, then it is interpolating. This conjecture concerns the coefficient-support behavior of partial-duality polynomials; the supplied text gives no resolution, so its status remains open.
Sources & referencesView supporting material
Primary source
Qiyao Chen and Yichao Chen, “Parallel edges in ribbon graphs and interpolating behavior of partial-duality polynomials”, arXiv:2106.00381 (2021).
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.