Rectangles Are Nonnegative Juntas
نویسندگان
چکیده
منابع مشابه
Noise-Resistant Boolean-Functions are Juntas
We consider Boolean functions over n binary variables, and a general p-biased, product measure over the inputs. We show that if f is of low-degree, that is, so that the weight of f on the Fourier-Walsh products of size larger than k is small, then f is close to a junta, namely, a function which depends only on very small, related to k however unrelated to n, number of variables. We conclude tha...
متن کاملIntersecting Families are Essentially Contained in Juntas
A family J of subsets of {1, . . . , n} is called a j-junta if there exists J ⊆ {1, . . . , n}, with |J | = j, such that the membership of a set S in J depends only on S ∩ J . In this paper we provide a simple description of intersecting families of sets. Let n and k be positive integers with k < n/2, and let A be a family of pairwise intersecting subsets of {1, . . . , n}, all of size k. We sh...
متن کاملLow degree almost Boolean functions are sparse juntas
Nisan and Szegedy showed that low degree Boolean functions are juntas. Kindler and Safra showed that low degree functions which are almost Boolean are close to juntas. Their result holds with respect to μp for every constant p. When p is allowed to be very small, new phenomena emerge. For example, the function y1 + · · · + yε/p (where yi ∈ {0, 1}) is close to Boolean but not close to a junta. W...
متن کاملIndependent Sets in Graph Powers are Almost Contained in Juntas
Let G = (V,E) be a simple undirected graph. Define G, the n-th power of G, as the graph on the vertex set V n in which two vertices (u1, . . . , un) and (v1, . . . , vn) are adjacent if and only if ui is adjacent to vi in G for every i. We give a characterization of all independent sets in such graphs whenever G is connected and non-bipartite. Consider the stationary measure of the simple rando...
متن کاملBoolean constant degree functions on the slice are juntas
We show that a Boolean degree d function on the slice ([n] k ) = {(x1, . . . , xn) ∈ {0, 1} : ∑n i=1 xi = k} is a junta, assuming that k, n − k are large enough. This generalizes a classical result of Nisan and Szegedy on the hypercube. Moreover, we show that the maximum number of coordinates that a Boolean degree d function can depend on is the same on the slice and the hypercube.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2016
ISSN: 0097-5397,1095-7111
DOI: 10.1137/15m103145x