arXiv:2306.12934 [math.CO]AbstractReferencesReviewsResources
On boundedness of zeros of the independence polynomial of tor
David de Boer, Pjotr Buys, Han Peters, Guus Regts
Published 2023-06-22Version 1
We study boundedness of zeros of the independence polynomial of tori for sequences of tori converging to the integer lattice. We prove that zeros are bounded for sequences of balanced tori, but unbounded for sequences of highly unbalanced tori. Here balanced means that the size of the torus is at most exponential in the shortest side length, while highly unbalanced means that the longest side length of the torus is super exponential in the product over the other side lengths cubed. We discuss implications of our results to the existence of efficient algorithms for approximating the independence polynomial on tori.
Comments: 45 pages, 5 figures
Related articles: Most relevant | Search more
arXiv:1903.05462 [math.CO] (Published 2019-03-13)
On the location of roots of the independence polynomial of bounded degree graphs
arXiv:1610.09806 [math.CO] (Published 2016-10-31)
The design of efficient algorithms for enumeration
arXiv:1701.08049 [math.CO] (Published 2017-01-27)
On a conjecture of Sokal concerning roots of the independence polynomial