Lipschitz bijections between boolean functions

DOI10.1017/S0963548320000541MaRDI QIDQ5886096zbMATH OpenOpenAlexFDO

Authors Tom Johnston, Alex Scott

Publication date 30 March 2023

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1812.09215

Mathematics Subject Classification ID

Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Combinatorics in computer science (68R05) Boolean functions (94D10)

Recommendations

• On Lipschitz bijections between Boolean functions
• Bi-Lipschitz bijection between the Boolean cube and the Hamming ball
• The growth of number of discrete Lipschitzian functions under growing dimensions of the domain of their definition
• Lipschitz representations of subsets of the cube
• Bi-Lipschitz bijections of Z

Cites work

• Bi-Lipschitz bijection between the Boolean cube and the Hamming ball
• Bounded-depth circuits cannot sample good codes
• Gaussian noise sensitivity and Fourier tails
• scientific article; zbMATH DE number 3957109 (Why is no real title available?)
• scientific article; zbMATH DE number 3216216 (Why is no real title available?)
• Noise sensitivity of Boolean functions and applications to percolation
• Noise stability of functions with low influences: invariance and optimality
• On Lipschitz bijections between Boolean functions
• On the distribution of the Fourier spectrum of Boolean functions
• On the hardness of approximating minimum vertex cover
• Probability and Computing
• The average sensitivity of bounded-depth circuits

Cited in

(3)

• Bi-Lipschitz bijection between the Boolean cube and the Hamming ball
• On Lipschitz bijections between Boolean functions
• On mappings on the hypercube with small average stretch

This page was built for publication: Lipschitz bijections between boolean functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5886096)