Re: Another Problem
The problem is concretely about Boolean functions of variables, and seems not to involve prime numbers at all. For any subset of the coordinate [indices], the corresponding Fourier coefficient is given by:
where is if is odd, and otherwise.
Note to Self. I need to play around with this concept a while.
Notation (from KLMMVjunta)
The order of a Fourier coefficient is
The Fourier expansion of is:
Added Notation (for shifting between coordinate indices and actual coordinates)
Begin with a survey of concrete examples, perhaps in tabular form.
For ease of reading formulas, let
To be continued …
|21 May 2013||Twin Primes Are Useful|
|08 Nov 2012||The Power Of Guessing|
|05 Jan 2011||Fourier Complexity Of Symmetric Boolean Functions|
|19 Nov 2010||Is Complexity Theory On The Brink?|
|18 Sep 2009||Why Believe That P=NP Is Impossible?|
|04 Jun 2009||The Junta Problem|