@article{23158,
  abstract     = {For a tree T and a function f:E(T)→Sd, the imbalance of a subtree T′⊆T is given by |∑e∈E(T′)f(e)|. The d-dimensional discrepancy of the tree T is the minimum, over all functions f as above, of the maximum imbalance of a subtree of T. We prove tight asymptotic bounds for the discrepancy of a tree T, confirming a conjecture of Krishna, Michaeli, Sarantis, Wang and Wang. We also settle a related conjecture on oriented discrepancy of subtrees by the same authors.},
  author       = {Hollom, Lawrence and Lichev, Lyuben and Mond, Adva and Portier, Julien},
  issn         = {1432-0444},
  journal      = {Discrete and Computational Geometry},
  keywords     = {Trees, High-dimensional discrepancy, Oriented discrepancy},
  publisher    = {Springer},
  title        = {{A note on high-dimensional discrepancy of subtrees}},
  doi          = {10.1007/s00454-025-00790-x},
  year         = {2026},
}