English

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

Number Theory 2013-04-23 v2

Abstract

In this paper we associate to any LSLS-sequence of partitions ρL,Sn{\rho_{L,S}^n} the corresponding LSLS-sequence of points ξL,Sn{\xi_{L,S}^n} obtained reordering the points of each partition with an explicit algorithm. The procedure begins with the representation in base L+SL+S of natural numbers, [n]L+S[n]_{L+S}, and ends with the LSLS-radical inverse function ϕL,S\phi_{L,S}, introduced ad hoc, evaluated at an appropriate subsequence of natural numbers depending on LL and SS. This construction is deeply related to the geometric representation of the points of ξL,Sn{\xi_{L,S}^n} by suitable affine functions and reminds the van der Corput sequences in base bb. Keywords: Uniform distribution, sequences of partitions, van der Corput sequences, discrepancy.

Keywords

Cite

@article{arxiv.1209.3611,
  title  = {A van der Corput-type algorithm for LS-sequences of points},
  author = {Ingrid Carbone},
  journal= {arXiv preprint arXiv:1209.3611},
  year   = {2013}
}

Comments

This paper is withdrawn as it is replaced by "How to construct generalized van der Corput sequences" - arXiv:1304.5083. The latter paper coincides with the former, up to minor changes, an improvement of the references, and (hopefully) a more clear presentation. The new title would better show the aim of the paper, which has been submitted in this final form

R2 v1 2026-06-21T22:06:13.107Z