Polynomial Arithmetic Analogue of Hickernell Sequences

Shu Tezuka ()
Additional contact information
Shu Tezuka: IBM Tokyo Research Laboratory

A chapter in Monte Carlo and Quasi-Monte Carlo Methods 2002, 2004, pp 451-459 from Springer

Abstract: 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.

Date: 2004
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-18743-8_28

Ordering information: This item can be ordered from
http://www.springer.com/9783642187438

DOI: 10.1007/978-3-642-18743-8_28

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().