ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be an arbitrary integer and let pp be a prime factor of nn. Let ω1=e2πip\omega_1=e^{\frac{2\pi i}{p}}, define ωi=ω1i\omega_i=\omega_1^i for 0≤i≤p−10\leq i\leq p-1, and set

B={1,ω1,…,ωp−1}n⊆Cn.B=\{1,\omega_1,\ldots,\omega_{p-1}\}^n\subseteq\mathbb C^n.

Let K(n,p)K(n,p) be the minimum kk for which there exist vectors v1,…,vk∈Bv_1,\ldots,v_k\in B such that for every w∈Bw\in B, some viv_i satisfies vi⋅w=0v_i\cdot w=0.

Exact balancing-set conjecture. For every integer nn and every prime factor pp of nn,

K(n,p)=n(p−1).K(n,p)=n(p-1).

The paper proves the lower bound K(n,p)≥n(p−1)K(n,p)\geq n(p-1); the conjecture asserts that this bound is attained, giving the exact minimum size of a family of vectors that balances every vector in BB.

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.