Strong m-ary sensitivity conjecture
Statement
Let be a positive integer, let be an -th primitive root of unity, and let be the Hamming graph. Write for possibly empty induced subgraphs whose vertex sets partition the vertices of , and let denote the maximum degree of . Strong -ary sensitivity conjecture. There exists such that, whenever
one has
The paper presents this as a stronger, more natural open reformulation of the -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.