ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be a tree with ℓ\ell leaves, and let DT\mathcal{DT} be the set of all directed rooted trees, namely trees with a distinguished root and all edges oriented away from it. Write D⃗(T,DT)\vec{\mathcal{D}}(T,\mathcal{DT}) for the oriented discrepancy of this family in TT. Asymptotic oriented discrepancy conjecture. For every such tree,

D⃗(T,DT)=(1+o(1))ℓ2.\vec{\mathcal{D}}(T,\mathcal{DT})=\left(1+o(1)\right)\frac{\ell}{2}.

The proven lower bound is ⌈ℓ/2⌉+1\lceil\ell/2\rceil+1, while the current general upper bound is ℓ\ell; 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 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.