English

Uniform optimal-order Wasserstein quantisation

Classical Analysis and ODEs 2026-04-01 v1 Number Theory

Abstract

We address Steinerberger's Wasserstein transport problem on the cube Q=[0,1]dQ=[0,1]^d. For every d2d\ge2, we consider a dyadic digital sequence (xn)Q(x_n)\subset Q and prove that every prefix {x1,,xN}\{x_1,\dots,x_N\} admits an exact equal-mass transport partition at the optimal scale. More precisely, for every NNN\in\mathbb{N}, there exist pairwise disjoint Borel sets A1,,ANQA_1,\dots,A_N\subset Q such that λd(An)=1N,AnB(xn,6dN1/d)(1nN), \lambda_d(A_n)=\frac1N,\qquad A_n\subset B(x_n,6\sqrt d\,N^{-1/d})\qquad(1\le n\le N), and λd ⁣(Qn=1NAn)=0\lambda_d\!\bigl(Q\setminus\bigcup_{n=1}^N A_n\bigr)=0. In other terms, every prefix of the sequence supports an exact transport allocation of Lebesgue mass to its points with uniformly controlled radius O(N1/d)O(N^{-1/d}). By an elementary partition criterion, this yields W ⁣(1Nn=1Nδxn,λd)6dN1/d(NN). W_\infty\!\left(\frac1N\sum_{n=1}^N\delta_{x_n},\,\lambda_d\right)\le 6\sqrt d\,N^{-1/d} \qquad(N\in\mathbb{N}). The bound holds for every 1p1\le p\le\infty. The exponent 1/d1/d is optimal, so it gives the sharp uniform prefix rate on the cube. The result settles Steinerberger's problem for all d1d\ge1 and all 1p1\le p\le\infty.

Cite

@article{arxiv.2603.29600,
  title  = {Uniform optimal-order Wasserstein quantisation},
  author = {Maja Gwozdz},
  journal= {arXiv preprint arXiv:2603.29600},
  year   = {2026}
}
R2 v1 2026-07-01T11:46:00.401Z