ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For ∈N \in\mathbb{N} and x∈Nn\mathbf{x}\in\mathbb{N}^{n}, a zero partition of x\mathbf{x} is a choice of signs σ∈{−1,1}n\sigma\in\{-1,1\}^{n} such that ⟨x,σ⟩=0\langle\mathbf{x},\sigma\rangle=0. Zero-partition maximization conjecture. If nn is even, the number of zero partitions of x\mathbf{x} is at most the number for (1,…,1)(1,\ldots,1), namely

(nn/2).\binom{n}{n/2}.

If nn is odd, it is at most the number for a vector whose entries are all 11 except one entry equal to 22. The conjecture proposes extremal bounds for zero-sum sign assignments, but the supplied text gives no resolution or further 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.