ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let MrM_r be the 2r×2r2^r \times 2^r integer matrix whose rows and columns are indexed by all maps fj:[r]→[2]f_j: [r] \rightarrow [2], with (i,j)(i,j)-entry

(∣fi−1(1)∩fj−1(1)∣2)+(∣fi−1(2)∩fj−1(2)∣2).\binom{|f_i^{-1}(1) \cap f_j^{-1}(1)|}{2} + \binom{|f_i^{-1}(2) \cap f_j^{-1}(2)|}{2}.

Positive-semidefiniteness conjecture. MrM_r is positive semidefinite for r≥3r \geq 3. The matrix is positive semidefinite in the cases considered computationally, enabling convex programming methods, but the assertion for all r≥3r \geq 3 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.