ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Gd(N,1/2,κ)\mathcal{G}_d(N,1/2,\kappa) be the hypergraphic planted clique model on NN vertices with fixed integer d≥2d\geq2, and let EHPCD\mathcal{E}_{{\rm HPC}_D} denote the sum of Type-I and Type-II errors of a test. HPC detection conjecture. If, for some τ>0\tau>0,

lim sup⁡N→∞log⁡κlog⁡N≤1−τ,\limsup_{N\to\infty}\frac{\log\kappa}{\log\sqrt{N}}\leq1-\tau,

then every sequence of polynomial-time tests {ϕN}\{\phi_N\} satisfies

lim inf⁡N→∞EHPCD(ϕN(\mathbfcalA))>12.\liminf_{N\to\infty}\mathcal{E}_{{\rm HPC}_D}(\phi_N({\mathbfcal A}))>\frac12.

The conjecture asserts computational hardness below the square-root clique-size scale. Exhaustive search gives the statistical threshold, while spectral methods reach the square-root scale; the source notes that whether HPC detection is equivalently hard as planted-clique detection 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.