Skip to main content

On Lipschitz Bijections Between Boolean Functions

  • SHRAVAS RAO (a1) and IGOR SHINKAR (a2)

Given two functions f,g : {0,1} n → {0,1}, a mapping ψ : {0,1} n → {0,1} n is said to be a mapping from f to g if it is a bijection and f(z) = g(ψ(z)) for every z ∈ {0,1} n . In this paper we study Lipschitz mappings between Boolean functions.

Our first result gives a construction of a C-Lipschitz mapping from the Majority function to the Dictator function for some universal constant C. On the other hand, there is no n/2-Lipschitz mapping in the other direction, namely from the Dictator function to the Majority function. This answers an open problem posed by Daniel Varga in the paper of Benjamini, Cohen and Shinkar (FOCS 2014 [1]).

We also show a mapping from Dictator to XOR that is 3-local, 2-Lipschitz, and its inverse is O(log(n))-Lipschitz, where by L-local mapping we mean that each output bit of the mapping depends on at most L input bits.

Next, we consider the problem of finding functions such that any mapping between them must have large average stretch, where the average stretch of a mapping φ is defined as $${\sf avgstretch}(\phi) = {\mathbb E}_{x,i}[{\sf dist}(\phi(x),\phi(x+e_i)].$$ We show that any mapping φ from XOR to Majority must satisfy avgStretch(φ) ≥ c $\sqrt{n}$ for some absolute constant c > 0. In some sense, this gives a ‘function analogue’ to the question of Benjamini, Cohen and Shinkar (FOCS 2014 [1]), who asked whether there exists a set A ⊆ {0,1} n of density 0.5 such that any bijection from {0,1} n−1 to A has large average stretch.

Finally, we show that for a random balanced function f: {0,1} n → {0,1} n , with high probability there is a mapping φ from Dictator to f such that both φ and φ−1 have constant average stretch. In particular, this implies that one cannot obtain lower bounds on average stretch by taking uniformly random functions.

Hide All
[1] Benjamini I., Cohen G. and Shinkar I. (2016) Bi-Lipschitz bijection between the Boolean cube and the Hamming ball. Israel J. Math. 212 677–703. Also in FOCS 2014: IEEE 55th Annual Symposium on Foundations of Computer Science.
[2] Bourgain J. (2002) On the distributions of the Fourier spectrum of Boolean functions. Israel J. Math. 131 269276.
[3] de Bruijn N. G., van Ebbenhorst Tengbergen C. and Kruyswijk D. (1951) On the set of divisors of a number. Nieuw Arch. Wiskunde (2) 23 191193.
[4] Håstad J., Leighton T. and Newman M. (1987) Reconfiguring a hypercube in the presence of faults. In STOC 1987: 19th Annual ACM Symposium on Theory of Computing, pp. 274–284.
[5] Kindler G. and O'Donnell R. (2012) Gaussian noise sensitivity and Fourier tails. In CCC 2012: 27th IEEE Conference on Computational Complexity, IEEE Computer Society, pp. 137–147.
[6] Lovett S. and Viola E. (2012) Bounded-depth circuits cannot sample good codes. Comput. Complexity 21 245266.
[7] Mossel E., O'Donnell R. and Oleszkiewicz K. (2010) Noise stability of functions with low influences: Invariance and optimality. Ann. of Math. (2) 171 295341.
[8] Viola E. (2012) The complexity of distributions. SIAM J. Comput. 41 191218.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *



Full text views

Total number of HTML views: 0
Total number of PDF views: 4 *
Loading metrics...

Abstract views

Total abstract views: 48 *
Loading metrics...

* Views captured on Cambridge Core between 19th December 2017 - 22nd January 2018. This data will be updated every 24 hours.