Variants of the Littlewood conjecture, their connection to uniformly distributed sequences, and the exact order of the discrepancy of van der Corput--Kronecker-type sequences
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912558279032832 |
|---|---|
| author | Hofer, Roswitha |
| author_facet | Hofer, Roswitha |
| contents | The aims of this paper are twofold. First, it discusses the Littlewood conjecture and its variants with respect to uniformly distributed sequences. The second aim is to determine the exact order of the discrepancy of the van der Corput--Kronecker-type sequences which are based on recent counterexamples to the $X$-adic Littlewood conjecture over a finite field. Our result on the exact order of the discrepancy supports the well-established conjecture in the theory of uniform distribution, which states that $D_N\leq c \frac{\log^s N}{N}$, with $c>0$ for all $N>1$ is the best possible upper bound for the discrepancy $D_N$ of a sequence in $[0,1)^s$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_11362 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Variants of the Littlewood conjecture, their connection to uniformly distributed sequences, and the exact order of the discrepancy of van der Corput--Kronecker-type sequences Hofer, Roswitha Number Theory 11K31, 11K38, 11J13 The aims of this paper are twofold. First, it discusses the Littlewood conjecture and its variants with respect to uniformly distributed sequences. The second aim is to determine the exact order of the discrepancy of the van der Corput--Kronecker-type sequences which are based on recent counterexamples to the $X$-adic Littlewood conjecture over a finite field. Our result on the exact order of the discrepancy supports the well-established conjecture in the theory of uniform distribution, which states that $D_N\leq c \frac{\log^s N}{N}$, with $c>0$ for all $N>1$ is the best possible upper bound for the discrepancy $D_N$ of a sequence in $[0,1)^s$. |
| title | Variants of the Littlewood conjecture, their connection to uniformly distributed sequences, and the exact order of the discrepancy of van der Corput--Kronecker-type sequences |
| topic | Number Theory 11K31, 11K38, 11J13 |
| url | https://arxiv.org/abs/2501.11362 |