Abstract
For any prime power q and any dimension s ⩾ 1, a new construction of (t, s)-sequences in base q using global function fields is presented. The construction yields an analog of Halton sequences for global function fields. It is the first general construction of (t, s)-sequences that is not directly based on the digital method. The construction can also be put into the framework of the theory of (u, e, s)-sequences that was recently introduced by Tezuka and leads in this way to better discrepancy bounds for the constructed sequences.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Colbourn C J, Dinitz J H, eds. Handbook of Combinatorial Designs, 2nd ed. Boca Raton: CRC Press, 2006
Dick J, Pillichshammer F. Digital Nets and Sequences: Discrepancy Theory and Quasi-Monte Carlo Integration. Cambridge: Cambridge University Press, 2010
Faure H, Kritzer P. New star discrepancy bounds for (t, m, s)-nets and (t, s)-sequences. Monatsh Math, in press, doi: 10.1007/s00605-012-0470-1
Halton J H. On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals. Numer Math, 1960, 2: 84–90
Hofer R, Niederreiter H. A construction of (t, s)-sequences with finite-row generating matrices using global function fields. Finite Fields Appl, 2013, 21: 97–110
Mayor D J S, Niederreiter H. A new construction of (t, s)-sequences and some improved bounds on their quality parameter. Acta Arith, 2007, 128: 177–191
Niederreiter H. Point sets and sequences with small discrepancy. Monatsh Math, 1987, 104: 273–337
Niederreiter H. Low-discrepancy and low-dispersion sequences. J Number Theory, 1988, 30: 51–70
Niederreiter H. Random Number Generation and Quasi-Monte Carlo Methods. Philadelphia: Soc Industrial Applied Math, 1992
Niederreiter H, Özbudak F. Low-discrepancy sequences using duality and global function fields. Acta Arith, 2007, 130: 79–97
Niederreiter H, Xing C P. Low-discrepancy sequences obtained from algebraic function fields over finite fields. Acta Arith, 1995, 72: 281–298
Niederreiter H, Xing C P. Low-discrepancy sequences and global function fields with many rational places. Finite Fields Appl, 1996, 2: 241–273
Niederreiter H, Xing C P. Quasirandom points and global function fields. In: Cohen S, Niederreiter H, eds. Finite Fields and Applications. London Math Soc Lecture Note Series, vol. 233. Cambridge: Cambridge University Press, 1996, 269–296
Niederreiter H, Xing C P. Nets, (t, s)-sequences, and algebraic geometry. In: Hellekalek P, Larcher G, eds. Random and Quasi-Random Point Sets. Lecture Notes in Statistics, vol. 138. New York: Springer, 1998, 267–302
Niederreiter H, Xing C P. Rational Points on Curves over Finite Fields: Theory and Applications. Cambridge: Cambridge University Press, 2001
Stichtenoth H. Algebraic Function Fields and Codes, 2nd ed. Berlin: Springer, 2009
Tezuka S. Polynomial arithmetic analogue of Halton sequences. ACM Trans Modeling Computer Simulation, 1993, 3: 99–107
Tezuka S. On the discrepancy of generalized Niederreiter sequences. J Complexity, 2013, 29: 240–247
Xing C P, Niederreiter H. A construction of low-discrepancy sequences using global function fields. Acta Arith, 1995, 73: 87–102
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Niederreiter, H., Yeo, A.S. Halton-type sequences from global function fields. Sci. China Math. 56, 1467–1476 (2013). https://doi.org/10.1007/s11425-013-4623-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11425-013-4623-z