The join zero conjecture for Speyer's polynomial
For integers , let be the join of the complete graph and the edgeless graph on vertices. A polynomial has a zero of order at a point if that point is a root of multiplicity at least .
Join zero conjecture. The polynomial has a zero of order at
This predicts systematic roots for Speyer polynomials of a broad family of joins. The paper presents it as an unproved formula supported by examples.
References
Primary source
Erik Panzer, “Graph theoretic properties of Speyer's matroid polynomial g_M(t)”, arXiv:2506.18788 (2025).
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.