ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=(V,E)G=(V,E) be a hypergraph, where a hypergraph is kk-uniform if every edge has size kk, and linear if each pair of edges intersects in at most one vertex. An independent set is a set of vertices containing no edge, and its independence polynomial is

ZG(λ)=∑I∈\cI(G)λ∣I∣.Z_G(\lambda)=\sum_{I\in\cI(G)}\lambda^{\lvert I\rvert}.

The maximum degree of GG is denoted by Δ\Delta.

Galvin–McKinley–Perkins–Sarantis–Tetali conjecture. For each k≥2k\geq 2, there exists a constant Ck>0C_k>0 such that, if GG is a kk-uniform linear hypergraph of maximum degree Δ\Delta and

∣λ∣≤CkΔ−1k−1,\lvert\lambda\rvert\leq C_k\Delta^{-\frac{1}{k-1}},

then

ZG(λ)≠0.Z_G(\lambda)\neq 0.

This conjecture proposes an improved zero-free region for the independence polynomial of linear hypergraphs. The paper's abstract states that it disproves this conjecture by constructing, for every k≥3k\geq 3, kk-uniform linear hypergraphs with arbitrarily large maximum degree having a root of modulus O(log⁡ΔΔ)O\left(\frac{\log\Delta}{\Delta}\right), so the conjecture is refuted.

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.