ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let mm be a positive integer, let ε\varepsilon be an mm-th primitive root of unity, and let H(n,m)H(n,m) be the Hamming graph. Write H1,…,HmH_1,\dots,H_m for possibly empty induced subgraphs whose vertex sets partition the vertices of H(n,m)H(n,m), and let Δ(Hi)\Delta(H_i) denote the maximum degree of HiH_i. Strong mm-ary sensitivity conjecture. There exists μ>0\mu>0 such that, whenever

∑i=1m∣V(Hi)∣εi≠0,\sum_{i=1}^{m}|V(H_i)|\varepsilon^i\neq 0,

one has

max⁡{Δ(H1),…,Δ(Hm)}∈Ω(nμ).\max\{\Delta(H_1),\dots,\Delta(H_m)\}\in\Omega(n^\mu).

The paper presents this as a stronger, more natural open reformulation of the mm-ary sensitivity conjecture. Its claimed strength is supported by the paper's discussion, while the relationship to the preceding formulation is the subject of the stated context.

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.