Skip to main content
Log in

On pseudo-random subsets of \({\mathbb Z _n}\)

  • Published:
Monatshefte für Mathematik Aims and scope Submit manuscript

Abstract

The notion of pseudo-randomness of subsets of \({\mathbb Z_n}\) is defined, and the measures of pseudo-randomness are introduced. Then a construction (based on the use of hybrid character sums) will be presented for subsets of \({\mathbb Z_p}\) with strong pseudo-random properties.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Chung F.R.K., Graham R.L.: Quasi-random subsets of \({\mathbb Z _n}\) . J. Combin. Theory Ser. A 61, 64–86 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  2. Dartyge, C., Mosaki, E., Sárközy, A.: On large families of subsets of the set of the integers not exceeding N. Ramanujan J. (2008, in press)

  3. Dartyge C., Sárközy A.: On pseudo-random subsets of the set of the integers not exceeding N. Period. Math. Hung. 54, 183–200 (2007)

    MATH  Google Scholar 

  4. Dartyge C., Sárközy A.: Large families of pseudorandom subsets formed by power residues. J. Unif. Distrib. Theory 2(2), 73–88 (2007)

    MATH  Google Scholar 

  5. Davenport H.: On the distribution of quadratic residues (mod p). J. Lond. Math. Soc. 6, 49–54 (1931)

    Article  MATH  Google Scholar 

  6. Davenport H.: On the distribution of quadratic residues (mod p) (second paper). J. Lond. Math. Soc. 8, 46–52 (1933)

    Article  MATH  Google Scholar 

  7. Drmota M., Tichy R.F.: Sequences, Discrepancies and Applications. Lecture Notes in Mathematics, vol. 1651. Springer, Heidelberg (1997)

    Google Scholar 

  8. Goubin L., Mauduit C., Sárközy A.: Construction of large families of pseudorandom binary sequences. J. Number Theory 106, 56–69 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  9. Grabner P.: Harmonische Analyse, Gleichverteilung und Ziffernentwicklungen. TU Vienna, Vienna (1989)

    Google Scholar 

  10. Hubert P., Mauduit C., Sárközy A.: On pseudorandom binary lattices. Acta Arith. 125, 51–62 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  11. Hubert P., Sárközy A.: On p-pseudorandom binary sequences. Period. Math. Hung. 49, 73–91 (2004)

    Article  MATH  Google Scholar 

  12. Mauduit C., Rivat J., Sárközy A.: Construction of pseudorandom binary sequences using additive characters. Monatshefte Math. 141, 197–208 (2004)

    Article  MATH  Google Scholar 

  13. Mauduit C., Sárközy A.: On finite pseudorandom binary sequences, I. Measure of pseudorandomness, the Legendre symbol. Acta Arith. 82, 365–377 (1997)

    MATH  MathSciNet  Google Scholar 

  14. Mauduit C., Sárközy A.: On finite pseudorandom binary sequences II. The Champernowne, Rudin-Shapiro, and Thue-Morse sequences: a further construction. J. Number Theory 73, 256–276 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  15. Mauduit C., Sárközy A.: On finite pseudorandom sequences of k symbols. Indag. Math. 13, 89–101 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  16. Mérai, L.: Construction of large families of pseudorandom binary sequences. Ramanujan J. (2008, in press)

  17. Oon, S.M.: Construction des suites binaires pseudo-aléatoires, thèse de l’Université Henri Poincaré-Nancy 1, Université Henri Poincaré-Nancy 1, juillet (2005)

  18. Oon S.M.: On some pseudorandom properties of Dirichlet’s characters. Ramanujan J. 15(1), 19–30 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  19. Rivat J., Sárközy A.: Modular construction of pseudorandom binary sequences with composite moduli. Period. Math. Hung. 51(2), 75–107 (2005)

    Article  MATH  Google Scholar 

  20. Sárközy A., Stewart C.L.: On pseudorandomness in families of sequences derived from the Legendre symbol. Period. Math. Hung. 54, 163–173 (2007)

    MATH  Google Scholar 

  21. Schmidt W.: Equations Over Finite Fields. An Elementary Approach. Lecture Notes in Mathematics, vol. 536. Springer, New York (1976)

    Google Scholar 

  22. Shparlinski I.: Cryptographic Applications of Analytic Number Theory. Complexity Lower Bounds and Pseudorandomness. Progress in Computer Science and Applied Logic, vol. 22. Birkhäuser, Basel (2003)

    Google Scholar 

  23. Tenenbaum G.: Introduction à la théorie analytique et probabiliste des nombres, 3rd edn. , Belin (2008)

  24. Vaaler J.D.: Some extremal functions in Fourier analysis. Bull. Am. Math. Soc. 12(2), 183–216 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  25. Weil, A.: Sur les courbes algébriques et les variétés qui s’en déduisent. Publ. Inst. Math. Univ. Strasbourg 7 (1945). Hermann, Paris (1948)

  26. Widder D.: The Laplace Transform. Princeton University Press, Princeton (1946)

    MATH  Google Scholar 

  27. Winterhof, A.: Incomplete additive character sums and applications. Finite Fields and Applications (Augsburg 1999), pp. 462–474. Springer, Berlin (2001)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Cécile Dartyge.

Additional information

Communicated by J. Schoißengeier.

A. Sárközy’s research was partially supported by the Hungarian National Foundation for Scientific Research, Grant K 67676 and T049693.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dartyge, C., Sárközy, A. On pseudo-random subsets of \({\mathbb Z _n}\) . Monatsh Math 157, 13–35 (2009). https://doi.org/10.1007/s00605-008-0072-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00605-008-0072-0

Keywords

Mathematics Subject Classification (2000)

Navigation