English
Related papers

Related papers: Boolean functions with small spectral norm, revisi…

200 papers

Suppose that f is a boolean function from F_2^n to {0,1} with spectral norm (that is the sum of the absolute values of its Fourier coefficients) at most M. We show that f may be expressed as +/- 1 combination of at most 2^(2^(O(M^4)))…

Classical Analysis and ODEs · Mathematics 2010-04-02 Ben Green , Tom Sanders

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

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

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 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

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 study inequalities of the form \begin{equation*} \rho ( \lvert \hat{f} \rvert) \leq C \sigma(f) < \infty, \end{equation*} with $f \in L_{1}(\mathbb{R}^n)$, the Lebesgue-integrable functions on $\mathbb{R}^n$ and \begin{equation*}…

Classical Analysis and ODEs · Mathematics 2023-03-14 Ron Kerman , Rama Rawat , Rajesh K. Singh

Given Boolean functions \( f, g : \mathbb{F}_2^n \to \{-1,+1\} \), we say they are {\em linearly isomorphic} if there exists \( A \in \mathrm{GL}_n(\mathbb{F}_2) \) such that \( f(x)=g(Ax) \) for all \( x \). We study this problem in the…

Computational Complexity · Computer Science 2026-01-14 Swarnalipa Datta , Arijit Ghosh , Chandrima Kayal , Manaswi Paraashar , Manmatha Roy

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

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

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 present a regularity lemma for Boolean functions $f:\{-1,1\}^n \to \{-1,1\}$ based on noisy influence, a measure of how locally correlated $f$ is with each input bit. We provide an application of the regularity lemma to weaken the…

Computational Complexity · Computer Science 2016-10-25 Chris Jones

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 Boolean function $f$ on $n$ variables is said to be a bent function if the absolute value of all its Walsh coefficients is $2^{n/2}$. Our main result is a new asymptotic lower bound on the number of Boolean bent functions. It is based on…

Combinatorics · Mathematics 2024-10-29 V. N. Potapov , A. A. Taranenko , Yu. V. Tarannikov

We consider linear spectral statistics of the form $\mathrm{tr} ( \varphi (H))$ for test functions $\varphi$ of low regularity and Wigner matrices $H$ with smooth entry distribution. We show that for functions $\varphi$ in the Sobolev space…

Probability · Mathematics 2022-04-08 Benjamin Landon , Philippe Sosoe

In this paper we prove a basic theorem which says that if f : F_p^n -> [0,1] has the property that ||f^||_(1/3) is not too ``large''(actually, it also holds for quasinorms 1/2-\delta in place of 1/3), and E(f) = p^{-n} sum_m f(m) is not too…

Number Theory · Mathematics 2007-05-23 Ernie Croot

We examine the question of when, and how, the norm of a vector functional on an operator algebra can be controlled by the invariant subspace lattice of the algebra. We introduce a related operator algebraic property, and show that it is…

Operator Algebras · Mathematics 2019-01-15 M. Anoussis , N. Ozawa , I. G. Todorov

We study the reduced Beurling spectra $sp_{\Cal {A},V} (F)$ of functions $F \in L^1_{loc} (\jj,X)$ relative to certain function spaces $\Cal{A}\st L^{\infty}(\jj,X)$ and $V\st L^1 (\r)$, where $\jj$ is $\r_+$ or $\r$ and $X$ is a Banach…

Functional Analysis · Mathematics 2010-06-18 Bolis Basit , Alan J. Pryde

In this paper we prove that if $X $ is a Banach space, then for every lower semi-continuous bounded below function $f, $ there exists a $\left(\varphi_1, \varphi_2\right)-$convex function $g, $ with arbitrarily small norm, such that $f + g…

Functional Analysis · Mathematics 2016-10-20 Abdelhakim Maaden , Abdelkader Stouti

Let $f: T\to \{ 0,1 \}$ be a Boolean function on the Boolean half-slice, $T$, \ie elements of $\{0,1\}^n$ with Hamming weight $n/2$. We show that if $f(x)+f(y)=f(x+y)$ holds with probability $\frac{1+\delta}{2}$ over a uniform pair $(x,y)$…

Computational Complexity · Computer Science 2026-05-27 Haakon Larsen , Tushant Mittal , Silas Richelson , Sourya Roy
‹ Prev 1 2 3 10 Next ›