Cut-at-vertex Bernardi conjecture for the exterior polynomial
Cut-at-vertex Bernardi conjecture for the exterior polynomial
Let be a connected hypergraph with a ribbon structure, base node, and base edge. Let be the exterior-inactivity polynomial defined from the (ht:, cut:) Bernardi process, and let be the exterior polynomial. One may alternatively define using the (ht:, cut:) Bernardi process.
Cut-at-vertex exterior-polynomial conjecture. For every such , , is independent of the ribbon structure, and both assertions remain true after redefining using the (ht:, cut:) process.
This is the exterior-polynomial counterpart of the preceding interior-polynomial results and is stated without a resolution in the source.
Sources & referencesView supporting material
Primary source
Tamás Kálmán and Lilla Tóthmérész, “Hypergraph polynomials and the Bernardi process”, arXiv:1810.00812 (2020).
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.