A van der Corput-type algorithm for LS-sequences of points
Abstract
In this paper we associate to any LS-sequence of partitions L,Sn the corresponding LS-sequence of points L,Sn obtained reordering the points of each partition with an explicit algorithm. The procedure begins with the representation in base L+S of natural numbers, [n]L+S, and ends with the LS-radical inverse function φL,S, introduced ad hoc, evaluated at an appropriate subsequence of natural numbers depending on L and S. This construction is deeply related to the geometric representation of the points of L,Sn by suitable affine functions and reminds the van der Corput sequences in base b. Keywords: Uniform distribution, sequences of partitions, van der Corput sequences, discrepancy.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.