Optimal zero-free regions for the independence polynomial of bounded degree hypergraphs
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 λs()=(-1)-1/. Recently it was shown by Galvin et al. that for hypergraphs the disk of radius λs(+1) is zero-free; however, it was conjectured that the actual truth should be λs(). We show that this is indeed the case. We also show that there exists an open region around the interval [0,(-1)-1/(-2)) 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 k-uniform linear hypertrees in terms of k and .
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.