Connectedness conjecture for the complement of the zero-locus

At least 4 years old · documented by

For each integer Δ≥3\Delta\geq 3, let GΔ\mathcal{G}_\Delta be the class of graphs of maximum degree at most Δ\Delta, and let

ZΔ={λ∈C:ZG(λ)=0 for some G∈GΔ},\mathcal{Z}_\Delta=\{\lambda\in\mathbb{C}:Z_G(\lambda)=0\text{ for some }G\in\mathcal{G}_\Delta\},

where ZG(λ)Z_G(\lambda) is the independence polynomial of GG evaluated at λ\lambda. The connectedness conjecture. For each integer Δ≥3\Delta\geq 3, the set

C∖ZΔ‾\mathbb{C}\setminus\overline{\mathcal{Z}_\Delta}

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.

References

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).

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.