Difference between revisions of "Majority"
m (→Properties) |
m |
||
| Line 13: | Line 13: | ||
* Majority is the [[Stability|stablest]] Boolean function. <ref>Ryan O'Donnell, Analysis of Boolean functions, [http://www.contrib.andrew.cmu.edu/~ryanod/?p=2245]</ref> | * Majority is the [[Stability|stablest]] Boolean function. <ref>Ryan O'Donnell, Analysis of Boolean functions, [http://www.contrib.andrew.cmu.edu/~ryanod/?p=2245]</ref> | ||
* Majority is the unique function that is [[:Category:symmetric function|symmetric]], [[:Category:monotone function|monotone]] and [[:Category:odd function|odd]] function. TODO May's theorem, credit. | * Majority is the unique function that is [[:Category:symmetric function|symmetric]], [[:Category:monotone function|monotone]] and [[:Category:odd function|odd]] function. TODO May's theorem, credit. | ||
| + | * Majority is not in [[:Category:AC0|AC0]], even if we allow using [[mod p]] functions as gates. <ref>A. Razborov, Lower bounds on the size of bounded-depth networks over a complete basis with logical addition (Russian), in Matematicheskie Zametki, Vol. 41, No 4, 1987, pages 598-607. English translation in Mathematical Notes of the Academy of Sci. of the USSR, 41(4):333-338, 1987.</ref> | ||
== References == | == References == | ||
Revision as of 06:07, 30 September 2018
Definition
A function [math]f:\{-1,1\}^n \to \{-1,1\}[/math] is called a majority function if [math]f(x)[/math] returns the most common bit in the input:
[math] f(x) = \begin{cases} 1, & if ~ \sum_i x_i \geq 0 \\ -1 & otherwise \end{cases}[/math]
For even [math]n[/math], the above definition breaks ties in favor of 1, although any arbitrary rule may be used instead.
Properties
- Majority only depends on the number of ones and is therefore a symmetric Boolean function.
- Majority is a monotone function.
- TODO: a description of Majority's Fourier Transform. See http://www.contrib.andrew.cmu.edu/~ryanod/?p=877 for details.
- Majority is the stablest Boolean function. [1]
- Majority is the unique function that is symmetric, monotone and odd function. TODO May's theorem, credit.
- Majority is not in AC0, even if we allow using mod p functions as gates. [2]
References
- ↑ Ryan O'Donnell, Analysis of Boolean functions, [1]
- ↑ A. Razborov, Lower bounds on the size of bounded-depth networks over a complete basis with logical addition (Russian), in Matematicheskie Zametki, Vol. 41, No 4, 1987, pages 598-607. English translation in Mathematical Notes of the Academy of Sci. of the USSR, 41(4):333-338, 1987.
