pith. sign in

arxiv: 1209.3611 · v2 · pith:C2K5XBPWnew · submitted 2012-09-17 · 🧮 math.NT

A van der Corput-type algorithm for LS-sequences of points

classification 🧮 math.NT
keywords pointssequencesalgorithmbasecorputnaturalnumberspartitions
0
0 comments X
read the original abstract

In this paper we associate to any $LS$-sequence of partitions ${\rho_{L,S}^n}$ the corresponding $LS$-sequence of points ${\xi_{L,S}^n}$ 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 $\phi_{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 ${\xi_{L,S}^n}$ 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.