On (Not) Computing the Möbius Function Using Bounded Depth Circuits
2012 ◽
Vol 21
(6)
◽
pp. 942-951
◽
Keyword(s):
Any function F: {0,. . ., N − 1} → {−1,1} such that F(x) can be computed from the binary digits of x using a bounded depth circuit is orthogonal to the Möbius function μ in the sense that \[ \frac{1}{N} \sum_{0 \leq x \leq N-1} \mu(x)F(x) → 0 \quad\text{as}~~ N → \infty. \] The proof combines a result of Linial, Mansour and Nisan with techniques of Kátai and Harman, used in their work on finding primes with specified digits.
1990 ◽
Vol 42
(2)
◽
pp. 185-189
◽
1962 ◽
Vol 13
(2)
◽
pp. 139-142
◽
1966 ◽
Vol 9
(05)
◽
pp. 571-574
◽
Keyword(s):
1965 ◽
Vol 17
◽
pp. 261-266
◽
1955 ◽
Vol 51
(4)
◽
pp. 565-576
◽
Keyword(s):
1967 ◽
Vol 63
(4)
◽
pp. 1027-1029
Keyword(s):