Low Discrepancy Digital Kronecker-Van der Corput Sequences
Abstract
The discrepancy of a sequence measures how quickly it approaches a uniform distribution. Given a natural number d, any collection of one-dimensional so-called low discrepancy sequences \Si:1 i d\ can be concatenated to create a d-dimensional hybrid sequence (S1,…,Sd). Since their introduction by Spanier in 1995, many connections between the discrepancy of a hybrid sequence and the discrepancy of its component sequences have been discovered. However, a proof that a hybrid sequence is capable of being low discrepancy has remained elusive. This paper remedies this by providing an explicit connection between Diophantine approximation over function fields and two dimensional low discrepancy hybrid sequences. Specifically, let Fq be the finite field of cardinality q. It is shown that some real numbered hybrid sequence H((t),P(t)):=H(,P) built from the digital Kronecker sequence associated to a Laurent series (t)∈Fq((t-1)) and the digital Van der Corput sequence associated to an irreducible polynomial P(t)∈Fq[t] meets the above property. More precisely, if (t) is a counterexample to the so called t-adic Littlewood Conjecture (t-LC), then another Laurent series (t)∈Fq((t-1)) induced from (t) and P(t) can be constructed so that H(,P) is low discrepancy. Such counterexamples to t-LC are known over a number of finite fields by, on the one hand, Adiceam, Nesharim and Lunnon, and on the other, by Garrett and the author.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.