Universal-constant conjecture for optimal balanced discrepancy
Statement
Let , and let denote the optimal balanced discrepancy for the module-lattice sign-selection problem. Write for the constant value proposed by the conjecture. Universal-constant conjecture. For all , the optimal balanced discrepancy is a universal constant
independent of . The value is supported computationally by certified MILP optimizations for and independent local-search verification; its precise number-theoretic identification 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.