𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Polynomial discrepancy of sequences

✍ Scribed by Bernhard Klinger; Robert F. Tichy


Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
443 KB
Volume
84
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

✦ Synopsis


Generalizing E. Hlawka's concept of polynomial discrepancy we introduce a similar concept for sequences in the unit cube and on the sphere. We investigate the relation of this polynomial discrepancy to the usual discrepancy and obtain lower and upper bounds. In a final section some computational results are established.


πŸ“œ SIMILAR VOLUMES


On the discrepancy of (0,1)-sequences
✍ Friedrich Pillichshammer πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 236 KB

We give bounds for the L p -discrepancy, pAN; of the van der Corput sequence in base 2. Further, we give a best possible upper bound for the star discrepancy of ð0; 1Þ-sequences and show that this bound is attained for the van der Corput sequence. Finally, we give a ð0; 1Þsequence with essentially s

Discrepancy of randomly sampled sequence
✍ Michel Weber πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 117 KB

## Abstract We estimate the discrepancy of (__nx__) when __n__ is sampled by a random walk and give examples involving the diophantine approximation properties of __x__. The proof relies upon the combination of the metric entropy method and the ErdΓΆs‐Turan inequality. (Β© 2004 WILEY‐VCH Verlag GmbH