Uniform distribution conjecture for the interlaced Halton sequence

About 2 years old · traced to

Let the dd-dimensional interlaced Halton sequence be the sequence constructed by Algorithm. A sequence (xn)n≥0(\mathbf{x}_n)_{n\geq 0} in [0,1)d[0,1)^d is uniformly distributed if, for every axis-parallel box B⊆[0,1)dB\subseteq[0,1)^d, the proportion of its first NN points lying in BB converges to the volume of BB as N→∞N\to\infty.

Uniform distribution conjecture. The dd-dimensional interlaced Halton sequence in Algorithm is uniformly distributed.

The construction is intended to provide a higher-dimensional sequence with more uniform projections than the classical Halton sequence. The source gives no proof or resolution of this conjecture.

References

Primary source

Nathan Kirk and Christiane Lemieux, “An improved Halton sequence for implementation in quasi-Monte Carlo methods”, arXiv:2405.15799 (2024).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.