ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a positive integer Δ\Delta, let UΔ\mathcal U_\Delta be the maximal simply connected open subset of C\mathbb C containing 00 that is zero-free for the independence polynomials of all graphs of maximum degree Δ\Delta. Let UΔ,k\mathcal U_{\Delta,k} be the analogous set for kk-uniform hypergraphs, and let UΔ,≥k\mathcal U_{\Delta,\geq k} be the analogous set for hypergraphs whose edge sizes are at least kk. Thus UΔ=UΔ,2\mathcal U_\Delta=\mathcal U_{\Delta,2}.

Zero-free locus conjecture. The zero-free locus of hypergraphs of maximum degree Δ\Delta is identical to the zero-free locus of graphs of maximum degree Δ\Delta:

UΔ,≥2=UΔ.\mathcal U_{\Delta,\geq 2}=\mathcal U_\Delta.

This asks whether allowing arbitrary edge sizes gives no smaller zero-free locus than graphs. The paper notes that its general zero-free disk theorem gives a disk of radius λs(Δ+1)\lambda_s(\Delta+1) inside UΔ,≥2\mathcal U_{\Delta,\geq 2}, but the equality of the full loci remains open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.