Abstract
Let q, q1,..., qs ≥ 2 be integers, and let α1, α2,... be a sequence of real numbers. In this paper we prove that the lower bound of the discrepancy of the double sequence (Formula Presented) coincides (up to a logarithmic factor) with the lower bound of the discrepancy of ordinary sequences (Formula Presented) in s-dimensional unit cube (s,M,N = 1, 2,...). We also find a lower bound of the discrepancy (up to a logarithmic factor) of the sequence (Formula Presented) (Korobov’s problem).
| Original language | English |
|---|---|
| Pages (from-to) | 483-527 |
| Number of pages | 45 |
| Journal | Journal de Theorie des Nombres de Bordeaux |
| Volume | 13 |
| Issue number | 2 |
| DOIs | |
| State | Published - 2001 |
Bibliographical note
Publisher Copyright:© Université Bordeaux 1, 2001, tous droits réservés.
Fingerprint
Dive into the research topics of 'On normal lattice configurations and simultaneously normal numbers'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver