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

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 finite fields. 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 ≤ c 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 .

Authors

Institutions

Publication Details

Journal
Journal de Théorie des Nombres de Bordeaux
Published
2026-09-16
DOI
https://doi.org/10.5802/jtnb.1369
Primary Topic
Mathematical Approximation and Integration
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
article

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

Roswitha Hofer
Journal de Théorie des Nombres de Bordeaux
Mathematical Approximation and Integration
article

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

Roswitha Hofer
article en

Abstract

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 finite fields. 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 ≤ c 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 .

Journal de Théorie des Nombres de BordeauxVol. 38(2)
Johannes Kepler University of Linz (AT)
Reduced inequalities
Openalex Percentile: Top 8%
Mathematical Approximation and Integration
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.