Skip to main content
Log in

Monotone Boolean functions capture their primes

  • Published:
Journal d'Analyse Mathématique Aims and scope

Abstract

It is shown that monotone Boolean functions on the Boolean cube capture the expected number of primes, under the usual identification by binary expansion. This answers a question posed by G. Kalai.

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. J. Bourgain, Prescribing the binary digits of primes, Israel J. Math. 194 (2013), 935–955.

    Article  MATH  MathSciNet  Google Scholar 

  2. J. Bourgain, On the Fourier-Walsh spectrum of the Moebius function, Israel J. Math. 197 (2013), 215–235.

    Article  MATH  MathSciNet  Google Scholar 

  3. N. Bassily and I. Katai, Distribution of the values of q-additive functions on polynomial sequences, Acta Math. Hungar. 68 (1995), 353–361.

    Article  MATH  MathSciNet  Google Scholar 

  4. N. Bshouty and C. Tamon, On the Fourier spectrum of monotone functions, J. ACM 43 (1996), 747–770.

    Article  MATH  MathSciNet  Google Scholar 

  5. M. Drmota, C. Mauduit, and J. Rivat, Primes with an average sum of digits, Compos. Math. 145 (2009), 271–292.

    Article  MATH  MathSciNet  Google Scholar 

  6. B. Green, On (not) computing the Möbius function using bounded depth circuits, Combin. Probab. and Comput. 21 (2012), 942–951.

    Article  MATH  MathSciNet  Google Scholar 

  7. G. Kalai, Private communications.

  8. M. Karpovsky, Finite Orthogonal Series in the Design of Digital Devices, Israel Universities Press, Jerusalem, 1976.

    MATH  Google Scholar 

  9. H. Iwaniec and E. Kowalski, Analytic Number Theory, American Mathematical Society, Providence, RI, 2004.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jean Bourgain.

Additional information

The research was partially supported by NSF grants DMS-0808042 and DMS-0835373.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bourgain, J. Monotone Boolean functions capture their primes. JAMA 124, 297–307 (2014). https://doi.org/10.1007/s11854-014-0033-6

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11854-014-0033-6

Keywords

Navigation