ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let DD-uniform hypergraphs on the vertex set [N][N] be hypergraphs whose hyperedges are incident on DD vertices. Under the null model, let G∼GD(N,p)G\sim\mathcal{G}_D(N,p), where each hyperedge is included independently with probability pp. Under the planted model, let G∼GD(N,p;K)G\sim\mathcal{G}_D(N,p;K), where K≥DK\geq D vertices are chosen uniformly at random, all (KD)\binom{K}{D} hyperedges among them are included, and every remaining hyperedge is included independently with probability pp. For a test ψN:HD,N↦{0,1}\psi_N:{\mathbb{H}}_{D,N}\mapsto\{0,1\}, define

E(ψN)=12EH0[ψN(G)]+12EH1[1−ψN(G)].\mathcal{E}(\psi_N)=\frac{1}{2}\mathbb{E}_{H_0}[\psi_N(G)]+\frac{1}{2}\mathbb{E}_{H_1}[1-\psi_N(G)].

Hypergraph planted clique conjecture. Suppose that p=1/2p=1/2 and that D≥2D\geq 2 is a fixed integer. If

lim sup⁡N→∞log⁡Klog⁡N<1,\limsup_{N\to\infty}\frac{\log K}{\log\sqrt{N}}<1,

then for every sequence of tests {ψN}N≥1\{\psi_N\}_{N\geq 1} computable in time polynomial in NDN^D,

lim inf⁡N→∞E(ψN)≥12.\liminf_{N\to\infty}\mathcal{E}(\psi_N)\geq\frac{1}{2}.

This is the assumed computational hardness of detecting a planted clique in a random DD-uniform hypergraph below the N\sqrt{N} scale, and it serves as the primitive for the paper's lower bounds on polynomial-time adaptation. No resolution status is supplied in the source.

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.