Connectedness conjecture for the complement of the zero-locus
Connectedness conjecture for the complement of the zero-locus
For each integer , let be the class of graphs of maximum degree at most , and let
where is the independence polynomial of evaluated at . The connectedness conjecture. For each integer , the set
is connected. The topology of the complement of the zero-locus is not understood; resolving this conjecture would clarify the global structure of the zero-free region relevant to approximating the independence polynomial.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
David de Boer, Pjotr Buys, Lorenzo Guerini, Han Peters and Guus Regts, “Zeros, chaotic ratios and the computational complexity of approximating the independence polynomial”, arXiv:2104.11615 (2021).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.