9 research outputs found
Invariance principle on the slice
We prove an invariance principle for functions on a slice of the Boolean
cube, which is the set of all vectors {0,1}^n with Hamming weight k. Our
invariance principle shows that a low-degree, low-influence function has
similar distributions on the slice, on the entire Boolean cube, and on Gaussian
space.
Our proof relies on a combination of ideas from analysis and probability,
algebra and combinatorics.
Our result imply a version of majority is stablest for functions on the
slice, a version of Bourgain's tail bound, and a version of the Kindler-Safra
theorem. As a corollary of the Kindler-Safra theorem, we prove a stability
result of Wilson's theorem for t-intersecting families of sets, improving on a
result of Friedgut.Comment: 36 page
Boolean degree 1 functions on some classical association schemes
We investigate Boolean degree 1 functions for several classical association
schemes, including Johnson graphs, Grassmann graphs, graphs from polar spaces,
and bilinear forms graphs, as well as some other domains such as multislices
(Young subgroups of the symmetric group). In some settings, Boolean degree 1
functions are also known as \textit{completely regular strength 0 codes of
covering radius 1}, \textit{Cameron--Liebler line classes}, and \textit{tight
sets}.
We classify all Boolean degree functions on the multislice. On the
Grassmann scheme we show that all Boolean degree functions are
trivial for , and , and that
for general , the problem can be reduced to classifying all Boolean degree
functions on . We also consider polar spaces and the bilinear
forms graphs, giving evidence that all Boolean degree functions are trivial
for appropriate choices of the parameters.Comment: 22 pages; accepted by JCTA; corrected Conjecture 6.
Hypercontractivity on high dimensional expanders
We prove hypercontractive inequalities on high dimensional expanders. As in the settings of the p-biased hypercube, the symmetric group, and the Grassmann scheme, our inequalities are effective for global functions, which are functions that are not significantly affected by a restriction of a small set of coordinates. As applications, we obtain Fourier concentration, small-set expansion, and Kruskal–Katona theorems for high dimensional expanders. Our techniques rely on a new approximate Efron–Stein decomposition for high dimensional link expanders
Boolean functions with restricted input and their robustness; application to the FLIP cipher
We study the main cryptographic features of Boolean functions (balancedness, nonlinearity, algebraic immunity) when, for a given number n of variables, the input to these functions is restricted to some subset E o
Invariance Principle on the Slice
© 2018 ACM. The non-linear invariance principle of Mossel, O'Donnell, and Oleszkiewicz establishes that if f (x1, . . . , xn) is a multilinear low-degree polynomial with low influences, then the distribution of f (B1, . . . , Bn ) is close (in various senses) to the distribution of f (G1, . . . , Gn ), where Bi ∈R{-1, 1} are independent Bernoulli random variables and Gi ~ N(0, 1) are independent standard Gaussians. The invariance principle has seen many applications in theoretical computer science, including the Majority is Stablest conjecture, which shows that the Goemans-Williamson algorithm for MAX-CUT is optimal under the Unique Games Conjecture. More generally, MOO's invariance principle works for any two vectors of hypercontractive random variables (x1, . . . , xn ), (Y1, . . . ,Yn ) such that (i) Matching moments: Xi and Yi have matching first and second moments and (ii) Independence: the variablesx1, . . . , xn are independent, as are Y1, . . . ,Yn. The independence condition is crucial to the proof of the theorem, yet in some cases we would like to use distributions (x1, . . . , xn ) in which the individual coordinates are not independent. A common example is the uniform distribution on the slice([n]k which consists of all vectors (x1, . . . , xn ) ∈ {0, 1}n with Hamming weight k. The slice shows up in theoretical computer science (hardness amplification, direct sum testing), extremal combinatorics (Erdös-Ko-Rado theorems), and coding theory (in the guise of the Johnson association scheme). Our main result is an invariance principle in which (X1, . . . ,Xn ) is the uniform distribution on a slice([n]pn) and (Y1, . . . ,Yn ) consists either of n independent Ber(p) random variables, or of n independent N(p,p(1 - p)) random variables. As applications, we prove a version of Majority is Stablest for functions on the slice, a version of Bourgain's tail theorem, a version of the Kindler-Safra structural theorem, and a stability version of the t-intersecting Erdös-Ko-Rado theorem, combining techniques of Wilson and Friedgut. Our proof relies on a combination of ideas from analysis and probability, algebra, and combinatorics. In particular, we make essential use of recent work of the first author which describes an explicit Fourier basis for the slice