Skip to main content Accessibility help
×
Hostname: page-component-76fb5796d-25wd4 Total loading time: 0 Render date: 2024-04-27T04:09:32.832Z Has data issue: false hasContentIssue false

9 - On an important family of inequalities of Niederreiter involving exponential sums

Published online by Cambridge University Press:  18 December 2014

Peter Hellekalek
Affiliation:
Salzburg University, Salzburg
Gerhard Larcher
Affiliation:
Johannes Kepler Universität Linz
Friedrich Pillichshammer
Affiliation:
Johannes Kepler Universität Linz
Arne Winterhof
Affiliation:
Austrian Academy of Sciences, Linz
Chaoping Xing
Affiliation:
Nanyang Technological University, Singapore
Get access

Summary

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2014

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] T., Cochrane, On a trigonometric inequality of Vinogradov. J. Number Theory, 27, 9–16, 1987.Google Scholar
[2] A., Compagner, Operational conditions for random-number generation. Phys. Rev. E 52, 5634–5645, 1995.Google Scholar
[3] W. L., Conover, Practical Nonparametric Statistics, third edition. Wiley, 1999.
[4] J., Dick and F., Pillichshammer, Digital Nets and Sequences: Discrepancy Theory and Quasi-Monte Carlo Integration. Cambridge University Press, Cambridge, 2010.
[5] M., Drmota and R. F., Tichy, Sequences, Discrepancies and Applications. Lecture Notes in Mathematics, volume 1651. Springer, Berlin, 1997.
[6] D., Gómez-Pérez, R., Hofer and H., Niederreiter, A general discrepancy bound for hybrid sequences involving Halton sequences. Unif. Distrib. Theory 8(1), 31–45, 2013.Google Scholar
[7] T., Gonzalez, S., Sahni and W. R., Franta, An efficient algorithm for the Kolmogorov–Smirnov and Lilliefors tests. ACM Trans. Math. Software 3, 60–64, 1977.
[8] P., Hellekalek, General discrepancy estimates: the Walsh function system. Acta Arith. 67, 209–218, 1994.Google Scholar
[9] P., Hellekalek, Good random number generators are (not so) easy to find. Math. Comp. Simul. 46, 485–505, 1998.Google Scholar
[10] P., Hellekalek, On the assessment of random and quasi-random point sets. In: P., Hellekalek and G., Larcher (eds.), Random and Quasi-Random Point Sets. Lecture Notes in Statistics, volume 138, pp. 49–108. Springer, New York, 1998.
[11] P., Hellekalek, A general discrepancy estimate based on p-adic arithmetics. Acta Arith. 139, 117–129, 2009.Google Scholar
[12] P., Hellekalek, A notion of diaphony based on p-adic arithmetic. Acta Arith. 145, 273–284, 2010.Google Scholar
[13] P., Hellekalek, Hybrid function systems in the theory of uniform distribution of sequences. In: L., Plaskota and H., Woźniakowski (eds.), Monte Carlo and Quasi-Monte Carlo Methods 2010. Springer Proceedings in Mathematics and Statistics, volume 25, pp. 435–449. Springer, Berlin, 2012.
[14] P., Hellekalek, A hybrid inequality of Erdős–Turán–Koksma for digital sequences. Monatsh. Math. 173, 55–66, 2014.Google Scholar
[15] P., Hellekalek, The hybrid spectral test: a unifying concept. In: P., Kritzer, H., Niederreiter, F., Pillichshammer and A., Winterhof (eds.), Uniform Distribution and Quasi-Monte Carlo Methods. Radon Series in Computational and Applied Mathematics. DeGruyter, Berlin, 2014.
[16] P., Hellekalek and H., Niederreiter, Constructions of uniformly distributed sequences using the b-adic method. Unif. Distrib. Theory 6(1), 185–200, 2011.Google Scholar
[17] E., Hewitt and K. A., Ross, Abstract Harmonic Analysis, volume 1. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], volume 115, second edition. Springer-Verlag, Berlin, 1979.
[18] D. E., Knuth, The Art of Computer Programming, volume 2, third edition. Addison-Wesley, Reading, MA, 1998.
[19] L., Kuipers and H., Niederreiter, Uniform Distribution of Sequences. John Wiley, New York, 1974. Reprint, Dover Publications, Mineola, NY, 2006.
[20] P., L'Ecuyer, Random number generation. In: J. E., Gentle, W., Haerdle and Y., Mori (eds.), Handbook of Computational Statistics, pp. 35–70. Springer, New York, 2004.
[21] P., L'Ecuyer and R., Simard, TestU01: a C library for empirical testing of random number generators. ACM Trans. Math. Software 33(4), Article 22, 2007.Google Scholar
[22] K., Mahler, p-adic Numbers and their Functions. Cambridge Tracts in Mathematics, volume 76, second edition. Cambridge University Press, Cambridge, 1981.
[23] H., Niederreiter. Pseudo-random numbers and optimal coefficients. Adv. Math. 26, 99–181, 1977.Google Scholar
[24] H., Niederreiter, Quasi-Monte Carlo methods and pseudo-random numbers. Bull. Am. Math. Soc. 84, 957–1041, 1978.Google Scholar
[25] H., Niederreiter, Pseudozufallszahlen und die Theorie der Gleichverteilung. Sitzungsber. Österr. Akad. Wiss. Math. Naturwiss Kl. II, 195, 109–138, 1986.Google Scholar
[26] H., Niederreiter, Random Number Generation and Quasi-Monte Carlo Methods. SIAM, Philadelphia, PA, 1992.
[27] H., Niederreiter, On the discrepancy of some hybrid sequences. Acta Arith. 138, 373–398, 2009.Google Scholar
[28] H., Niederreiter, A discrepancy bound for hybrid sequences involving digital explicit inversive pseudorandom numbers. Unif. Distrib. Theory 5(1), 53–63, 2010.Google Scholar
[29] H., Niederreiter, Further discrepancy bounds and an Erdős–Turán–Koksma inequality for hybrid sequences. Monatsh. Math. 161, 193–222, 2010.Google Scholar
[30] H., Niederreiter, Discrepancy bounds for hybrid sequences involving matrix-method pseudorandom vectors. Publ. Math. Debrecen 79(3–4), 589–603, 2011.Google Scholar
[31] H., Niederreiter, Improved discrepancy bounds for hybrid sequences involving Halton sequences. Acta Arith. 155(1), 71–84, 2012.Google Scholar
[32] H., Niederreiter and I. E., Shparlinski, Recent advances in the theory of nonlinear pseudorandom number generators. In: K.-T., Fang, F. J., Hickernell and H., Niederreiter (eds.), Monte Carlo and Quasi-Monte Carlo Methods 2000, pp. 86–102. Springer, New York, 2002.
[33] H., Niederreiter and A., Winterhof, Discrepancy bounds for hybrid sequences involving digital explicit inversive pseudorandom numbers. Unif. Distrib. Theory 6(1), 33–56, 2011.Google Scholar
[34] F., Schipp, W. R., Wade and P., Simon, With the collaboration of J. Pál, Walsh Series. An Introduction to Dyadic Harmonic Analysis. Adam Hilger, Bristol, 1990.
[35] A., Topuzoğlu and A., Winterhof, Pseudorandom sequences. Topics in Geometry, Coding Theory and Cryptography. Algebra and Applications, volume 6, pp. 135–166. Springer, Dordrecht, 2007.
[36] A., Winterhof, Recent results on recursive nonlinear pseudorandom number generators (invited paper). In: C., Carlet and A., Pott (eds.), Sequences and their Applications, SETA 2010. Lecture Notes in Computer Science, volume 6338, pp. 113–124. Springer, Berlin, 2010.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×