Tbilisi Mathematical Journal

On the Walsh-Hadamard transform of monotone Boolean functions

Abstract

Let $f:GF(2)^n \rightarrow GF(2)$ be a monotone Boolean function. Associated to $f$ is the Cayley graph $X$ whose vertices correspond to points of $GF(2)^n$ and whose edges correspond to pairs of vectors $(v,w)$ whose sum is in the support of $f$. The spectrum of $X$ (the set of eigenvalues of its adjacency matrix) can be computed in terms of the Walsh-Hadamard transform of $f$. We show that if $f$ is atomic, the adjacency matrix of $X$ is singular if and only if the support of $f$ has an even number of elements. We ask whether it is true that for every even monotone function the adjacency matrix of the Cayley graph must be singular. We give an example in dimension $n=6$ to show that the answer to this question is no. We use Sage to compute some examples of monotone Boolean functions, their Cayley graphs, and the graph spectra. We include some interesting characterizations of monotone functions. We give some conditions on a monotone function that imply that the function is not bent. Finally, we ask whether it is true that no even monotone function is bent, for $n>2$.

Article information

Source
Tbilisi Math. J., Volume 5, Issue 2 (2012), 19-35.

Dates
First available in Project Euclid: 12 June 2018

https://projecteuclid.org/euclid.tbilisi/1528768900

Digital Object Identifier
doi:10.32513/tbilisi/1528768900

Mathematical Reviews number (MathSciNet)
MR3055512

Zentralblatt MATH identifier
1283.06021

Citation

Celerier, Charles; Joyner, David; Melles, Caroline; Phillips, David. On the Walsh-Hadamard transform of monotone Boolean functions. Tbilisi Math. J. 5 (2012), no. 2, 19--35. doi:10.32513/tbilisi/1528768900. https://projecteuclid.org/euclid.tbilisi/1528768900

References

• A. Bernasconi and B. Codenotti, Spectral analysis of Boolean functions as a graph eigenvalue problem, Computers, IEEE Transactions on 48(3) (1999), 345–351.
• A. Bernasconi, B. Codenotti and J. VanderKam, A characterization of bent functions in terms of strongly regular graphs, Computers, IEEE Transactions on 50(9) (2001), 984–985.
• D. Bienstock and M. Zuckerberg, Solving LP relaxations of largescale precedence constrained problems, Integer Programming and Combinatorial Optimization 6080 (2010), 1-14.
• C. Carlet, Boolean functions for cryptography and error correcting codes, In Y. Crama and P. L. Hammer, editors, Boolean Methods and Models, Cambridge University Press, 2006.
• C. Celerier, github repository, https://github.com/celerier/oslo/.
• D.S. Hochbaum and A. Chen, Performance analysis and best implementations of old and new algorithms for the open-pit mining problem, Operations Research 48(6) (2000), 894-914.
• T.B. Johnson, Optimum open pit mine production scheduling, Technical report, DTIC Document, 1968.
• D. Kleitman, On Dedekind's problem: the number of monotone Boolean functions, Proc. Amer. Math. Soc. 21(3) (1969), 677-682.
• D. Orlin, Optimal weapons allocation against layered defenses, Naval Research Logistics (NRL) 34(5) (1987), 605-617.
• J. M. W. Rhys, A selection problem of shared fixed costs and network flows, Management Science 17(3) (1970), 200-207.
• P. Stanica, Graph eigenvalues and Walsh spectrum of Boolean functions, Integers: Electronic Journal Of Combinatorial Number Theory 7(2) (2007), A32.