Optimal Zero‐Free Regions for the Independence Polynomial of Bounded Degree Hypergraphs
Authors:
Open Access
- 27 June 2025
- journal article
- Published by Wiley in Random Structures & Algorithms
- Vol. 66 (4)
Abstract
In this paper, we investigate the distribution of zeros of the independence polynomial of hypergraphs of maximum degree . For graphs, the largest zero‐free disk around zero was described by Shearer as having radius . Recently, it was shown by Galvin et al. that for hypergraphs the disk of radius is zero‐free; however, it was conjectured that the actual truth should be . We show that this is indeed the case. We also show that there exists an open region around the interval that is zero‐free for hypergraphs of maximum degree , which extends the result of Peters and Regts from graphs to hypergraphs. Finally, we determine the radius of the largest zero‐free disk for the family of bounded degree ‐uniform linear hypertrees in terms of and .Keywords
All Related Versions
This publication has 23 references indexed in Scilit:
- The Ising Partition Function: Zeros and Deterministic ApproximationJournal of Statistical Physics, 2018
- Rapid mixing of hypergraph independent setsRandom Structures & Algorithms, 2018
- On trees with real-rooted independence polynomialDiscrete Mathematics, 2018
- A Survey on Recurrence Relations for the Independence Polynomial of HypergraphsGraphs and Combinatorics, 2016
- Combinatorics and Complexity of Partition Functions2016
- A converse to the Grace–Walsh–Szegő theoremMathematical Proceedings of the Cambridge Philosophical Society, 2009
- Path coupling using stopping times and counting independent sets and colorings in hypergraphsRandom Structures & Algorithms, 2008
- The roots of the independence polynomial of a clawfree graphJournal of Combinatorial Theory, Series B, 2007
- On a problem of spencerCombinatorica, 1985
- Bemerkungen zu einem Satz von J. H. Grace ber die Wurzeln algebraischer GleichungenMathematische Zeitschrift, 1922