Abstract
The theory of ( t , s ) (t,s) -sequences leads to powerful constructions of low-discrepancy sequences in an s s -dimensional unit cube. We generalize this theory in order to cover arbitrary sequences constructed by the digital method and, in particular, the Kronecker-type sequences introduced by the second author. We define diophantine approximation constants for formal Laurent series over finite fields and show their connection with the distribution properties of Kronecker-type sequences. The main results include probabilistic theorems on the distribution of sequences constructed by the digital method and on the diophantine approximation character of s s -tuples of formal Laurent series over finite fields.
Cite
CITATION STYLE
Larcher, G., & Niederreiter, H. (1995). Generalized (π‘,π )-sequences, Kronecker-type sequences, and Diophantine approximations of formal Laurent series. Transactions of the American Mathematical Society, 347(6), 2051β2073. https://doi.org/10.1090/s0002-9947-1995-1290724-1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.