Monotone Boolean functions capture their primes
From MaRDI portal
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.
Recommendations
- scientific article; zbMATH DE number 3867232
- Boolean functions with long prime implicants
- Additive functions monotonic on the set of primes
- Properties of Boolean functions with the extremal number of prime implicants
- On the nonlinearity of monotone Boolean functions
- scientific article; zbMATH DE number 1936762
- Generating Essential Primes for a Boolean Function with Multiple-Valued Inputs
- Functions computed by monotone Boolean formulas with no repeated variables
- scientific article; zbMATH DE number 3863116
- scientific article; zbMATH DE number 4204284
Cites work
- scientific article; zbMATH DE number 3526576 (Why is no real title available?)
- scientific article; zbMATH DE number 2121181 (Why is no real title available?)
- Distribution of the values of \(q\)-additive functions on polynomial sequences
- On (not) computing the Möbius function using bounded depth circuits
- On the Fourier spectrum of monotone functions
- On the Fourier-Walsh spectrum of the Moebius function
- Prescribing the binary digits of primes
- Primes with an average sum of digits
Cited in
(3)
This page was built for publication: Monotone Boolean functions capture their primes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2253712)
