The exact balancing-set conjecture for vectors with pth roots of unity
Statement
Let be an arbitrary integer and let be a prime factor of . Let , define for , and set
Let be the minimum for which there exist vectors such that for every , some satisfies .
Exact balancing-set conjecture. For every integer and every prime factor of ,
The paper proves the lower bound ; the conjecture asserts that this bound is attained, giving the exact minimum size of a family of vectors that balances every vector in .
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.