Outperforming the Best 1D Low-Discrepancy Constructions with a Greedy Algorithm

François Clément

The design of uniformly spread sequences on $[0,1)$ has been extensively studied since the work of Weyl and van der Corput in the early $20^{\text{th}}$ century. The current best s…