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.
Similar content being viewed by others
References
J. Bourgain, Prescribing the binary digits of primes, Israel J. Math. 194 (2013), 935–955.
J. Bourgain, On the Fourier-Walsh spectrum of the Moebius function, Israel J. Math. 197 (2013), 215–235.
N. Bassily and I. Katai, Distribution of the values of q-additive functions on polynomial sequences, Acta Math. Hungar. 68 (1995), 353–361.
N. Bshouty and C. Tamon, On the Fourier spectrum of monotone functions, J. ACM 43 (1996), 747–770.
M. Drmota, C. Mauduit, and J. Rivat, Primes with an average sum of digits, Compos. Math. 145 (2009), 271–292.
B. Green, On (not) computing the Möbius function using bounded depth circuits, Combin. Probab. and Comput. 21 (2012), 942–951.
G. Kalai, Private communications.
M. Karpovsky, Finite Orthogonal Series in the Design of Digital Devices, Israel Universities Press, Jerusalem, 1976.
H. Iwaniec and E. Kowalski, Analytic Number Theory, American Mathematical Society, Providence, RI, 2004.
Author information
Authors and Affiliations
Corresponding author
Additional information
The research was partially supported by NSF grants DMS-0808042 and DMS-0835373.
Rights and permissions
About this article
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
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11854-014-0033-6