ON THE UPPER BOUND OF THE Lp DISCREPANCY OF HALTON’S SEQUENCE AND THE CENTRAL LIMIT THEOREM FOR HAMMERSLEY’S NET, II

Mordechay B. Levin

Research output: Contribution to journalArticlepeer-review

Abstract

Let Hs+1,N=(Hs(n),n/N)n=0N-1 be the s+1-dimensional Hammersley’s point set. Let D(x¯,(Hs+1,N)n=0N-1) be the local discrepancy of (Hs+1,N)n=0N-1, and let Ds,p((Hs+1,N)n=0N-1) be the Lp discrepancy of (Hs+1,N)n=0N-1. In this Part II of our paper, we prove the Central Limit Theorem for Hammersley’s net: (Formula presented.) where x¯ is a uniformly distributed random variable in [0,1]s+1 and we claim that the lower bound of Lp discrepancy for p>0 is of the same order as the upper bound: (Formula presented.)

Original languageEnglish
Pages (from-to)1030-1064
Number of pages35
JournalJournal of Mathematical Sciences
Volume280
Issue number6
DOIs
StatePublished - Apr 2024

Bibliographical note

Publisher Copyright:
© The Author(s), under exclusive licence to Springer Nature Switzerland AG 2024.

Keywords

  • Central limit theorem
  • Halton’s sequence

Fingerprint

Dive into the research topics of 'ON THE UPPER BOUND OF THE Lp DISCREPANCY OF HALTON’S SEQUENCE AND THE CENTRAL LIMIT THEOREM FOR HAMMERSLEY’S NET, II'. Together they form a unique fingerprint.

Cite this