---
res:
  bibo_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.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Lawrence
      foaf_name: Hollom, Lawrence
      foaf_surname: Hollom
  - foaf_Person:
      foaf_givenName: Lyuben
      foaf_name: Lichev, Lyuben
      foaf_surname: Lichev
      foaf_workInfoHomepage: http://www.librecat.org/personId=9aa8388e-d003-11ee-8458-c4c1d7447977
  - foaf_Person:
      foaf_givenName: Adva
      foaf_name: Mond, Adva
      foaf_surname: Mond
  - foaf_Person:
      foaf_givenName: Julien
      foaf_name: Portier, Julien
      foaf_surname: Portier
  bibo_doi: 10.1007/s00454-025-00790-x
  dct_date: 2026^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/0179-5376
  - http://id.crossref.org/issn/1432-0444
  dct_language: eng
  dct_publisher: Springer@
  dct_subject:
  - Trees
  - High-dimensional discrepancy
  - Oriented discrepancy
  dct_title: A note on high-dimensional discrepancy of subtrees@
...