Difference between revisions of "Majority"
m |
m |
||
| Line 16: | Line 16: | ||
<references/> | <references/> | ||
| − | [[Category:symmetric function]] | + | [[Category:symmetric function]] [[Category:monotone function]] |
Revision as of 10:32, 5 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]
