Monotone Boolean functions capture their primes
Number Theory
2012-11-30 v1
Abstract
It is shown that monotone Boolean functions on the Boolean cube capture the expected number of primes, under he usual identification by binary expansion. This answers a question posed by G.Kalai.
Keywords
Cite
@article{arxiv.1211.6760,
title = {Monotone Boolean functions capture their primes},
author = {Jean Bourgain},
journal= {arXiv preprint arXiv:1211.6760},
year = {2012}
}