Complex discrepancy conjecture for trees
Statement
Let be a tree with leaves, let denote the family of trees used in the discrepancy definition, and let denote the one-dimensional, or complex, discrepancy. Write for the maximum degree of . Complex discrepancy conjecture. For every tree with leaves,
If, in addition, , then
The preceding theorem proves the weaker universal lower bound ; the conjecture proposes the sharp trigonometric bound and asymptotic equality for trees of unbounded maximum degree.
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.