Summary
Recently, Hickernell introduced a new class of low-discrepancy sequences which is an infinite version of good lattice points. His sequences are constructed from multiplying the van der Corput sequence by an integer vector. In this paper, we define the polynomial arithmetic analogue of Hickernell sequences by using polynomials over finite fields GF(b), and show that this new type of sequences constitute a class of digital (t, s)-sequences. Then, we give two versions of matrix representation for their generator matrices, and prove that for the first version, there do not exist (0, s)-sequences for any base b ≥ 2 and any dimension s ≥ 2, and that for the second version, there do not exist (0, s)-sequences in base b = 2 for any s ≥ 2.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
H. Faure, Discrépance de suites associées à un système de numération en dimension s, Acta Arith. 41 (1982), 337–351.
H. Faure, On the Distribution of the Sums of Binomial Coefficients Modulo a Prime, Monatsh. Math. 131 (2000), 263–277.
F. J. Hickernell, Lattice Rules: How Well Do They Measure Up? in Random and Quasi-Random Point Sets, edited by P. Hellekalek and G. Larcher, Lecture Notes in Statistics, 138, Springer, New York (1998), 109–166.
F. J. Hickernell and H. Niederreiter, The Existence of Good Extensible Rank-1 Lattices, Journal of Complexity 19 (2003), 286–300.
H. Niederreiter, Random Number Generation and Quasi-Monte Carlo Methods, CBMS-NSF Regional Conference Series in Applied Mathematics, No. 63, SIAM, Philadelphia, 1992.
H. Niederreiter, The Existence of Good Extensible Polynomial Lattice Rules, Monatsh. Math. 139 (2003), 295–307.
A. Papageorgiou and S. Paskov, Deterministic Simulation for Risk Management, Journal of Portfolio Management, 25th anniversary issue, (May, 1999), 122–127.
A. Papageorgiou and J. F. Traub, Beating Monte Carlo, RISK 9 (June 1996), 63–65.
S. Tezuka, Polynomial Arithmetic Analogue of Halton Sequences, ACM Trans. Modeling and Computer Simulation 3 (1993), 99–107.
S. Tezuka, Uniform Random Numbers: Theory and Practice, Kluwer Academic Publishers, Boston, 1995.
S. Tezuka, Quasi-Monte Carlo — Discrepancy between Theory and Practice, in Monte Carlo and Quasi-Monte Carlo Methods 2000, edited by K.T. Fang, F. Hickernell, and H. Niederreiter, Springer, Berlin (2002), 124–140.
S. Tezuka and H. Faure, I-binomial Scrambling of Digital Nets and Sequences, to appear Journal of Complexity (2003).
S. Tezuka and T. Tokuyama, A Note on Polynomial Arithmetic Analogue of Halton Sequences, ACM Trans. Modeling and Computer Simulation 4 (1994), 279–284.
Y. Wang and F. J. Hickernell, An Historical Overview of Lattice Point Sets, in Monte Carlo and Quasi-Monte Carlo Methods 2000, edited by K.T. Fang, F. Hickernell, and H. Niederreiter, Springer, Berlin (2002), 158–167.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tezuka, S. (2004). Polynomial Arithmetic Analogue of Hickernell Sequences. In: Niederreiter, H. (eds) Monte Carlo and Quasi-Monte Carlo Methods 2002. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18743-8_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-18743-8_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20466-4
Online ISBN: 978-3-642-18743-8
eBook Packages: Springer Book Archive