Asymptotic oriented discrepancy conjecture for directed rooted trees
Statement
Let be a tree with leaves, and let be the set of all directed rooted trees, namely trees with a distinguished root and all edges oriented away from it. Write for the oriented discrepancy of this family in . Asymptotic oriented discrepancy conjecture. For every such tree,
The proven lower bound is , while the current general upper bound is ; the conjecture asks for an asymptotically matching upper bound.
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.