2012/11/28 by Jean Bourgain, Bourgain, Jean
Computer Science · Mathematics · #semigroups and automata theory #Advanced Algebra and Logic #Advanced Combinatorial Mathematics
paper · pdf · doi:10.48550/arxiv.1211.6760
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.