中文
相关论文

相关论文: Friedgut--Kalai--Naor theorem for slices of the Bo…

200 篇论文

The Friedgut-Kalai-Naor (FKN) theorem states that if $f$ is a Boolean function on the Boolean cube which is close to degree 1, then $f$ is close to a dictator, a function depending on a single coordinate. The author has extended the theorem…

组合数学 · 数学 2020-04-01 Yuval Filmus

We consider Boolean functions f:{-1,1}^n->{-1,1} that are close to a sum of independent functions on mutually exclusive subsets of the variables. We prove that any such function is close to just a single function on a single subset. We also…

概率论 · 数学 2015-12-31 Aviad Rubinstein , Muli Safra

In this note we consider Boolean functions defined on the discrete cube equipped with a biased product probability measure. We prove that if the spectrum of such a function is concentrated on the first two Fourier levels, then the function…

组合数学 · 数学 2013-11-14 Piotr Nayar

We show that if $f\colon S_n \to \{0,1\}$ is $\epsilon$-close to linear in $L_2$ and $\mathbb{E}[f] \leq 1/2$ then $f$ is $O(\epsilon)$-close to a union of "mostly disjoint" cosets, and moreover this is sharp: any such union is close to…

组合数学 · 数学 2021-12-13 Yuval Filmus

The Fourier-Walsh expansion of a Boolean function $f \colon \{0,1\}^n \rightarrow \{0,1\}$ is its unique representation as a multilinear polynomial. The Kindler-Safra theorem (2002) asserts that if in the expansion of $f$, the total weight…

组合数学 · 数学 2019-01-28 Nathan Keller , Ohad Klein

The influence of the $k$'th coordinate on a Boolean function $f:\{0,1\}^n \rightarrow \{0,1\}$ is the probability that flipping $x_k$ changes the value $f(x)$. The total influence $I(f)$ is the sum of influences of the coordinates. The…

组合数学 · 数学 2018-06-06 Nathan Keller , Noam Lifshitz

Let $f$ be a real-valued, degree-$d$ Boolean function defined on the $n$-dimensional Boolean cube $\{\pm 1\}^{n}$, and $f(x) = \sum_{S \subset \{1,\ldots,d\}} \widehat{f}(S) \prod_{k \in S} x_k$ its Fourier-Walsh expansion. The main result…

泛函分析 · 数学 2017-06-13 Andreas Defant , Mieczysław Mastyło , Antonio Pérez

The Fourier Entropy-Influence (FEI) conjecture of Friedgut and Kalai [FK96] seeks to relate two fundamental measures of Boolean function complexity: it states that $H[f] \leq C Inf[f]$ holds for every Boolean function $f$, where $H[f]$…

计算复杂性 · 计算机科学 2013-04-05 Ryan O'Donnell , Li-Yang Tan

In this paper we introduce the study of quantum boolean functions, which are unitary operators f whose square is the identity: f^2 = I. We describe several generalisations of well-known results in the theory of boolean functions, including…

量子物理 · 物理学 2010-12-20 Ashley Montanaro , Tobias J. Osborne

This note is concerned with an extension, at second order, of an inequality on the discrete cube $C_n=\{-1,1\}$ (equipped with the uniform measure) due to Talagrand (\cite{TalL1L2}). As an application, the main result of this note is a…

概率论 · 数学 2019-10-22 Kevin Tanguy

A classical result of Rothschild and van Lint asserts that if every non-zero Fourier coefficient of a Boolean function $f$ over $\mathbb{F}_2^{n}$ has the same absolute value, namely $|\hat{f}(\alpha)|=1/2^k$ for every $\alpha$ in the…

计算复杂性 · 计算机科学 2021-04-01 Ning Xie , Shuai Xu , Yekun Xu

We study functions on the infinite-dimensional Hamming cube $\{-1,1\}^\infty$, in particular Boolean functions into $\{-1,1\}$, generalising results on analysis of Boolean functions on $\{-1,1\}^n$ for $n\in\mathbb{N}$. The notion of noise…

概率论 · 数学 2019-06-11 Vilhelm Agdur

The Bohr theorem states that any function $f(z) = \sum_{n=0}^{\infty} a_{n} z^{n}$, analytic and bounded in the open unit disk, obeys the inequality $\sum_{n=0}^{\infty} |a_{n}| |z|^{n} < 1$ in the open disk of radius 1/3, the so-called…

复变函数 · 数学 2010-04-09 J. Morais , K. Guerlebeck

Consider a Boolean function f on the n-dimensional hypercube, and a set of variables (indexed by) $S \subset \{1,2,\ldots,n\}.$ The coalition influence of the variables S on a function f is the probability that after a random assignment of…

组合数学 · 数学 2026-01-19 Tomasz Przybyłowski

The seminal result of Kahn, Kalai and Linial shows that a coalition of $O(\frac{n}{\log n})$ players can bias the outcome of any Boolean function $\{0,1\}^n \to \{0,1\}$ with respect to the uniform measure. We extend their result to…

离散数学 · 计算机科学 2019-02-21 Yuval Filmus , Lianna Hambardzumyan , Hamed Hatami , Pooya Hatami , David Zuckerman

In this expository article, we study the relation between the boolean functions and the hypercontractivity theorems of Aline Bonami. We focus on the social choice theory, and present some of the most important results in the area, such as…

经典分析与常微分方程 · 数学 2025-02-20 María José González , Paul MacManus , María Cristina Pereyra

The Fourier Entropy-Influence (FEI) Conjecture of Friedgut and Kalai states that ${\bf H}[f] \leq C \cdot {\bf I}[f]$ holds for every Boolean function $f$, where ${\bf H}[f]$ denotes the spectral entropy of $f$, ${\bf I}[f]$ is its total…

计算复杂性 · 计算机科学 2019-01-25 Guy Shalev

We study sequences of functions of the form F_p^n -> {0,1} for varying n, and define a notion of convergence based on the induced distributions from restricting the functions to a random affine subspace. Using a decomposition theorem and a…

组合数学 · 数学 2013-08-20 Hamed Hatami , Pooya Hatami , James Hirst

Talagran's correlation inequality provides quantitative lower bounds on the covariance of two increasing Boolean functions in terms of their coordinate influences, but, in general, a logarithmic loss is necessary. Motivated by a question of…

组合数学 · 数学 2026-05-19 Fan Chang , Yu Chen

We prove two main results on how arbitrary linear threshold functions $f(x) = \sign(w\cdot x - \theta)$ over the $n$-dimensional Boolean hypercube can be approximated by simple threshold functions. Our first result shows that every…

计算复杂性 · 计算机科学 2009-10-21 Ilias Diakonikolas , Rocco A. Servedio
‹ 上一页 1 2 3 10 下一页 ›