English
Related papers

Related papers: Boolean functions with small spectral norm

200 papers

The sum of the absolute values of the Fourier coefficients of a function $f:\mathbb{F}_2^n \to \mathbb{R}$ is called the spectral norm of $f$. Green and Sanders' quantitative version of Cohen's idempotent theorem states that if the spectral…

Discrete Mathematics · Computer Science 2024-12-02 Tsun-Ming Cheung , Hamed Hatami , Rosie Zhao , Itai Zilberstein

We show that if $f$ is an integer-valued function with spectral norm at most $M$ then there are subspaces $V_1,\dots,V_L$ and signs $\sigma_1,\dots,\sigma_L \in \{-1,1\}$ such that $f=\sigma_1 1_{V_1} + \dots + \sigma_L 1_{V_L}$ where $L <…

Classical Analysis and ODEs · Mathematics 2019-08-15 Tom Sanders

The spectral norm of a Boolean function $f:\{0,1\}^n \to \{-1,1\}$ is the sum of the absolute values of its Fourier coefficients. This quantity provides useful upper and lower bounds on the complexity of a function in areas such as learning…

Computational Complexity · Computer Science 2012-05-25 Anil Ada , Omar Fawzi , Hamed Hatami

In this paper we prove results regarding Boolean functions with small spectral norm (the spectral norm of f is $\|\hat{f}\|_1=\sum_{\alpha}|\hat{f}(\alpha)|$). Specifically, we prove the following results for functions $f:\{0,1\}^n \to…

Computational Complexity · Computer Science 2013-05-23 Amir Shpilka , Avishay Tal , Ben lee Volk

Boolean functions on the space $F_{2}^m$ are not only important in the theory of error-correcting codes, but also in cryptography, where they occur in private key systems. In these two cases, the nonlinearity of these function is a main…

Number Theory · Mathematics 2015-06-26 Francois Rodier

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…

Probability · Mathematics 2015-12-31 Aviad Rubinstein , Muli Safra

Indicator functions mentioned in the title are constructed on an arbitrary nondiscrete locally compact Abelian group of finite dimension. Moreover, they can be obtained by small perturbation from any indicator function fixed beforehand. In…

Classical Analysis and ODEs · Mathematics 2020-06-05 S. V. Kislyakov , P. S. Perstneva

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…

Computational Complexity · Computer Science 2021-04-01 Ning Xie , Shuai Xu , Yekun Xu

A function $f:\ \{-1,1\}^n\rightarrow \mathbb{R}$ is called pseudo-Boolean. It is well-known that each pseudo-Boolean function $f$ can be written as $f(x)=\sum_{I\in {\cal F}}\hat{f}(I)\chi_I(x),$ where ${\cal F}\subseteq \{I:\ I\subseteq…

Discrete Mathematics · Computer Science 2012-12-04 Gregory Gutin , Anders Yeo

A function defined on the Boolean hypercube is $k$-Fourier-sparse if it has at most $k$ nonzero Fourier coefficients. For a function $f: \mathbb{F}_2^n \rightarrow \mathbb{R}$ and parameters $k$ and $d$, we prove a strong upper bound on the…

Data Structures and Algorithms · Computer Science 2015-04-08 Ishay Haviv , Oded Regev

Let $F$ be a vectorial Boolean function from $\mathbb{F}_2^n$ to $\mathbb{F}_2^m$, with $m \geq n$. We define $F$ as an embedding if $F$ is injective. In this paper, we examine the component functions of $F$, focusing on constant and…

Cryptography and Security · Computer Science 2025-05-29 Augustine Musukwa , Massimiliano Sala

We show examples of total Boolean functions that depend on $n$ variables and have spectral sensitivity $\Theta(\sqrt{\log n})$, which is asymptotically minimal. Our main new function combines the Hamming code with the Boolean address…

Computational Complexity · Computer Science 2025-02-21 Krišjānis Prūsis , Jevgēnijs Vihrovs

It is a well-known fact that Riemann Hypothesis will follows if the function identically equal to -1 can be arbitrarily approximated in the norm $\norma{.}$ of $L^{2}([0,1],dx)$ by functions of the form $f(x)=\sum_{k=1}^{n}a_{k}…

Number Theory · Mathematics 2007-05-23 F. Auil

We ask whether most Boolean functions are determined by their low frequencies. We show a partial result: for almost every function $f: \{-1,1\}^p \to \{-1,1\}$ there exists a function $f': \{-1,1\}^p \to (-1,1)$ that has the same…

Combinatorics · Mathematics 2024-12-24 Roman Vershynin

We study Boolean functions with sparse Fourier coefficients or small spectral norm, and show their applications to the Log-rank Conjecture for XOR functions f(x\oplus y) --- a fairly large class of functions including well studied ones such…

Computational Complexity · Computer Science 2013-04-10 Hing Yin Tsang , Chung Hoi Wong , Ning Xie , Shengyu Zhang

Suppose that A is a subset of F_2^n of density as close to 1/3 as possible. We show that the A(F_2^n)-norm (that is the sum of the absolute values of the Fourier transform) of the characterstic function of A is bounded below by an absolute…

Classical Analysis and ODEs · Mathematics 2010-04-01 Tom Sanders

In this report, we show that all n-variable Boolean function can be represented as polynomial threshold functions (PTF) with at most $0.75 \times 2^n$ non-zero integer coefficients and give an upper bound on the absolute value of these…

Discrete Mathematics · Computer Science 2020-07-07 Erhan Oztop , Minoru Asada

If $f$ is a nonzero Bohr almost periodic function on $\mathbb R$ with a bounded spectrum we prove there exist $C_f > 0$ and integer $n > 0$ such that for every $u > 0$ the mean measure of the set $\{\, x \, : \, |f(x)| < u \, \}$ is less…

Functional Analysis · Mathematics 2019-04-23 Wayne Lawton

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…

Functional Analysis · Mathematics 2017-06-13 Andreas Defant , Mieczysław Mastyło , Antonio Pérez

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…

Quantum Physics · Physics 2010-12-20 Ashley Montanaro , Tobias J. Osborne
‹ Prev 1 2 3 10 Next ›