Book contents
- Frontmatter
- Contents
- Preface
- 1 Some highlights of Harald Niederreiter's work
- 2 Partially bent functions and their properties
- 3 Applications of geometric discrepancy in numerical analysis and statistics
- 4 Discrepancy bounds for low-dimensional point sets
- 5 On the linear complexity and lattice test of nonlinear pseudorandom number generators
- 6 A heuristic formula estimating the keystream length for the general combination generator with respect to a correlation attack
- 7 Point sets of minimal energy
- 8 The cross-correlation measure for families of binary sequences
- 9 On an important family of inequalities of Niederreiter involving exponential sums
- 10 Controlling the shape of generating matrices in global function field constructions of digital sequences
- 11 Periodic structure of the exponential pseudorandom number generator
- 12 Construction of a rank-1 lattice sequence based on primitive polynomials
- 13 A quasi-Monte Carlo method for the coagulation equation
- 14 Asymptotic formulas for partitions with bounded multiplicity
- 15 A trigonometric approach for Chebyshev polynomials over finite fields
- 16 Index bounds for value sets of polynomials over finite fields
- 17 Rational points of the curve over
- 18 On the linear complexity of multisequences, bijections between ℤahlen and ℕumber tuples, and partitions
- Plate section
- References
4 - Discrepancy bounds for low-dimensional point sets
Published online by Cambridge University Press: 18 December 2014
Book contents
- Frontmatter
- Contents
- Preface
- 1 Some highlights of Harald Niederreiter's work
- 2 Partially bent functions and their properties
- 3 Applications of geometric discrepancy in numerical analysis and statistics
- 4 Discrepancy bounds for low-dimensional point sets
- 5 On the linear complexity and lattice test of nonlinear pseudorandom number generators
- 6 A heuristic formula estimating the keystream length for the general combination generator with respect to a correlation attack
- 7 Point sets of minimal energy
- 8 The cross-correlation measure for families of binary sequences
- 9 On an important family of inequalities of Niederreiter involving exponential sums
- 10 Controlling the shape of generating matrices in global function field constructions of digital sequences
- 11 Periodic structure of the exponential pseudorandom number generator
- 12 Construction of a rank-1 lattice sequence based on primitive polynomials
- 13 A quasi-Monte Carlo method for the coagulation equation
- 14 Asymptotic formulas for partitions with bounded multiplicity
- 15 A trigonometric approach for Chebyshev polynomials over finite fields
- 16 Index bounds for value sets of polynomials over finite fields
- 17 Rational points of the curve over
- 18 On the linear complexity of multisequences, bijections between ℤahlen and ℕumber tuples, and partitions
- Plate section
- References
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Applied Algebra and Number Theory , pp. 58 - 90Publisher: Cambridge University PressPrint publication year: 2014
References
[1] , Minoration de la discrépance d'une suite quelconque surT. Acta Arith. 41, 185–202, 1982.Google Scholar
[2] , and . On the small ball inequality in all dimensions. J. Funct. Anal. 254, 2470–2502, 2008.Google Scholar
[3] , A method for exact calculation of the star discrepancy of plane sets applied to the sequences of Hammersley. Monatsh. Math. 101, 261–278, 1986.Google Scholar
[4] and , A best possible upper bound on the star discrepancy of (t, m, 2)-nets. Monte Carlo Methods Appl. 12, 1–17, 2006.Google Scholar
[5] and , Digital Nets and Sequences. Discrepancy Theory and Quasi-Monte Carlo Integration. Cambridge University Press, Cambridge, 2010.
[6] and , Sequences, Discrepancies and Applications. Lecture Notes in Mathematics, volume 1651. Springer, Berlin, 1997
[7] and , On the discrepancy of (nα) sequences. Topics in Classical Number Theory, Colloq. Budapest 1981, volume I, Colloq. Math. Soc. Janos Bolyai 34, 355–387, 1984.Google Scholar
[8] , Discrépance de suites associées à un système de numération (en dimension un). Bull. Soc. Math. France 109, 143–182, 1981.Google Scholar
[9] , Discrépance de suites associées à un système de numération (en dimension s). Acta Arith. 41, 337–351, 1982.Google Scholar
[10] , On the star-discrepancy of generalized Hammersley sequences in two dimensions. Monatsh. Math. 101, 291–300, 1986.Google Scholar
[12] , Discrepancy and diaphony of digital (0, 1)-sequences in prime bases. Acta Arith. 117, 125–148, 2005.Google Scholar
[13] , Irregularities of distribution of digital (0, 1)-sequences in prime bases. Integers 5, A07 (electronic), 2005.Google Scholar
[14] , Van der Corput sequences towards (0, 1)-sequences in baseb. J. Théor. Nombres Bordeaux 19, 125–140, 2007.Google Scholar
[15] , Improvements on low discrepancy one-dimensional sequences and two-dimensional point sets. In: , and (eds.), Monte Carlo and Quasi-Monte Carlo Methods 2006, pp. 327–341. Springer, Berlin, 2008.
[16] , Star extreme discrepancy of generalized two-dimensional Hammersley point sets. Unif. Distrib. Theory 3(2), 45–65, 2008.Google Scholar
[17] and , Minoration de discrépance en dimension deux. Acta Arith. 76, 149–164, 1996.Google Scholar
[18] and , New star discrepancy bounds for (t, m, s)-nets and (t, s)-sequences. Monatsh. Math. 172, 55–75, 2013.Google Scholar
[19] and , Generalized Halton sequences in 2008: a comparative study. ACM Trans. Model. Comp. Sim. 19(4), Article 15, 2009.Google Scholar
[20] and , Improved Halton sequences and discrepancy bounds. Monte Carlo Methods Appl. 16, 231–250, 2010.Google Scholar
[21] and , Improvements on the star discrepancy of (t, s)-sequences. Acta Arith. 154, 61–78, 2012.Google Scholar
[22] and , A generalization of NUT digital (0, 1)-sequences and best possible lower bounds for star discrepancy. Acta Arith. 158, 321–340, 2013.Google Scholar
[23] , On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals. Numer. Math. 2, 184–190, 1960.Google Scholar
[24] and , The extreme and the L2 discrepancies of some plane sets. Monatsh. Math. 73, 316–328, 1969.Google Scholar
[25] , A new upper bound on the star discrepancy of (0, 1)-sequences. Integers 5, A11 (electronic), 2005.Google Scholar
[26] , Improved upper bounds on the star discrepancy of (t, m, s)-nets and (t, s)-sequences. J. Complexity 22, 336–347, 2006.Google Scholar
[27] , On some remarkable properties of the two-dimensional Hammersley point set in base 2. J. Théor. Nombres Bordeaux 18, 203–221, 2006.Google Scholar
[28] , and , A thorough analysis of the discrepancy of shifted Hammersley and van der Corput point sets. Ann. Math. Pura Appl. 186, 229–250, 2007.Google Scholar
[29] and , Uniform Distribution of Sequences. John Wiley, New York, 1974. Reprint, Dover Publications, Mineola, NY, 2006.
[30] , On the star-discrepancy of sequences in the unit interval. Submitted, 2013.
[31] and , Sums of distances to the nearest integer and the discrepancy of digital nets. Acta Arith. 106, 379–408, 2003.Google Scholar
[32] , Monte Carlo and Quasi-Monte Carlo Sampling. Springer Series in Statistics. Springer, New York, 2009.
[33] , Point sets and sequences with small discrepancy. Monatsh. Math. 104, 273–337, 1987.Google Scholar
[34] , Random Number Generation and Quasi-Monte Carlo Methods. CBMS-NSF Series in Applied Mathematics, volume 63. SIAM, Philadelphia, PA, 1992.
[35] , (t, m, s)-nets and (t, s)-sequences. In: and (eds.), Handbook of Finite Fields, pp. 619–630. CRC Press, Boca Raton, FL, 2013.
[36] and , Low-discrepancy sequences and global function fields with many rational places. Finite Fields Appl. 2, 241–273, 1996.Google Scholar
[37] and , Quasirandom points and global function fields. In: and (eds.), Finite Fields and Applications. London Mathematical Society Lecture Note Series, volume 233, pp. 269–296. Cambridge University Press, Cambridge, 1996.
[38] , Recent progress in improvement of extreme discrepancy and star discrepancy of one-dimensional sequences. In: and (eds.), Monte Carlo and Quasi-Monte Carlo Methods 2008, pp. 561–572. Springer, Berlin, 2009.
[39] , Improved upper bounds for the star discrepancy of digital nets in dimension 3. Acta Arith. 108, 167–189, 2003.Google Scholar
[43] and , Lattice Methods for Multiple Integration. Oxford University Press, New York, 1994.
[44] , Distribution of points in a cube and the approximate evaluation of integrals. USSR Comput. Math. Math. Phys. 7, 86–112, 1967.Google Scholar
[45] , Polynomial arithmetic analogue of Halton sequences. ACM Trans. Model. Comp. Sim. 3, 99–107, 1993.Google Scholar
- 1
- Cited by