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...
Hlavní autor: | Green, B |
---|---|
Médium: | Journal article |
Vydáno: |
2011
|
Podobné jednotky
-
Quadratic Uniformity of the Mobius Function
Autor: Green, B, a další
Vydáno: (2006) -
The Mobius function is strongly orthogonal to nilsequences
Autor: Green, B, a další
Vydáno: (2008) -
Compact Circuits for Efficient Möbius Transform
Autor: Subhadeep Banik, a další
Vydáno: (2024-03-01) -
Sharp bounds on partition dimension of hexagonal Möbius ladder
Autor: Muhammad Azeem, a další
Vydáno: (2022-02-01) -
On Möbius gyrogroup and Möbius gyrovector space
Autor: Kurosh Mavaddat Nezhaad, Ali Reza Ashrafi
Vydáno: (2023-11-01)