On (not) computing the Mobius function using bounded depth circuits
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 Mobius function mu in the sense that E_{0 <= x <= N-1} mu(x)F(x) = o(1). The proof combines a result of Linial, Mansour and Nisan...
المؤلف الرئيسي: | Green, B |
---|---|
التنسيق: | Journal article |
منشور في: |
2011
|
مواد مشابهة
-
Quadratic Uniformity of the Mobius Function
حسب: Green, B, وآخرون
منشور في: (2006) -
The Mobius function is strongly orthogonal to nilsequences
حسب: Green, B, وآخرون
منشور في: (2008) -
Compact Circuits for Efficient Möbius Transform
حسب: Subhadeep Banik, وآخرون
منشور في: (2024-03-01) -
Sharp bounds on partition dimension of hexagonal Möbius ladder
حسب: Muhammad Azeem, وآخرون
منشور في: (2022-02-01) -
On Möbius gyrogroup and Möbius gyrovector space
حسب: Kurosh Mavaddat Nezhaad, Ali Reza Ashrafi
منشور في: (2023-11-01)