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)