Monotone Boolean functions capture their primes
From MaRDI portal
Publication:2253712
DOI10.1007/s11854-014-0033-6zbMath1370.11113arXiv1211.6760OpenAlexW2161171711MaRDI QIDQ2253712
Publication date: 12 February 2015
Published in: Journal d'Analyse Mathématique (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.6760
Related Items (3)
Prime numbers along Rudin-Shapiro sequences ⋮ Prime numbers in two bases ⋮ Prescribing the binary digits of primes. II
Cites Work
- Unnamed Item
- Unnamed Item
- On the Fourier-Walsh spectrum of the Moebius function
- Distribution of the values of \(q\)-additive functions on polynomial sequences
- Prescribing the binary digits of primes
- On (Not) Computing the Möbius Function Using Bounded Depth Circuits
- Primes with an average sum of digits
- On the Fourier spectrum of monotone functions
This page was built for publication: Monotone Boolean functions capture their primes