On boundedness of zeros of the independence polynomial of tori
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916370344574976 |
|---|---|
| author | de Boer, David Buys, Pjotr Peters, Han Regts, Guus |
| author_facet | de Boer, David Buys, Pjotr Peters, Han Regts, Guus |
| contents | 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.
This project was partially inspired by the relationship between zeros of partition functions and holomorphic dynamics, a relationship that in the last two decades played a prominent role in the field. Besides presenting new results, we survey this relationship and its recent consequences. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2306_12934 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | On boundedness of zeros of the independence polynomial of tori de Boer, David Buys, Pjotr Peters, Han Regts, Guus Combinatorics Data Structures and Algorithms Mathematical Physics 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. This project was partially inspired by the relationship between zeros of partition functions and holomorphic dynamics, a relationship that in the last two decades played a prominent role in the field. Besides presenting new results, we survey this relationship and its recent consequences. |
| title | On boundedness of zeros of the independence polynomial of tori |
| topic | Combinatorics Data Structures and Algorithms Mathematical Physics |
| url | https://arxiv.org/abs/2306.12934 |