English
Related papers

Related papers: On the Fourier-Walsh Spectrum on the Moebius Funct…

200 papers

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

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

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 several problems related to the restriction of $(\nabla^k) \hat{f}$ to a surface $\Sigma \subset \mathbb R^d$ with nonvanishing Gauss curvature. While such restrictions clearly exist if $f$ is a Schwartz function, there are few…

Classical Analysis and ODEs · Mathematics 2018-11-09 Michael Goldberg , Dmitriy Stolyarov

We study the asymptotic decay of the Fourier spectrum of real functions $f\colon \{-1,1\}^N \rightarrow \mathbb{R}$ in the spirit of Bohr's phenomenon from complex analysis. Every such function admits a canonical representation through its…

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

In this paper, we address the random sampling problem for the class of Mellin band-limited functions BT which is concentrated on a bounded cube. It is established that any function in BT can be approximated by an element in a…

Functional Analysis · Mathematics 2023-05-25 Shivam Bajpeyi , Dhiraj Patel , S. Sivananthan

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

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

We demonstrate a phenomenon of condensation of the Fourier transform $\widehat{f}$ of a function $f$ defined on the real line $\mathbb{R}$ which decreases rapidly on one half of the line. For instance, we prove that if $f$ is…

Complex Variables · Mathematics 2023-11-28 Bartosz Malman

We consider, for a class of functions $\varphi : \mathbb{R}^{2} \setminus \{ {\bf 0} \} \to \mathbb{R}^{2}$ satisfying a nonisotropic homogeneity condition, the Fourier transform $\hat{\mu}$ of the Borel measure on $\mathbb{R}^{4}$ defined…

Classical Analysis and ODEs · Mathematics 2022-07-21 Tomás Godoy , Pablo Rocha

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 design of plateaued functions over $GF(2)^n$, also known as 3-valued Walsh spectra functions (taking the values from the set $\{0, \pm 2^{\lceil \frac{n+s}{2} \rceil}\}$), has been commonly approached by specifying a suitable algebraic…

Information Theory · Computer Science 2018-11-13 S. Hodžić , E. Pasalic , Y. Wei , F. Zhang

For a function $f$ on the hypercube $\{0,1\}^n$ with Fourier expansion $f=\sum_{S\subseteq[n]}\hat f(S)\chi_S$, the hypercontractive inequality allows bounding norms of $T_\rho f=\sum_S\rho^{|S|} \hat f(S)\chi_S$ in terms of norms of $f$.…

Combinatorics · Mathematics 2025-11-26 Nathan Keller , Noam Lifshitz , Omri Marcus

Let $(M,g)$ be a smooth, compact, Riemannian manifold and $\{\phi_h\}$ a sequence of $L^2$-normalized Laplace eigenfunctions on $M$. For a smooth submanifold $H\subset M$, we consider the growth of the restricted eigenfunctions $\phi_h|_H$…

Analysis of PDEs · Mathematics 2022-04-06 Madelyne M. Brown

We do the spectral analysis of the Hamiltonian for the weak leptonic decay of the gauge bosons W+/-. Using Mourre theory, it is shown that the spectrum between the unique ground state and the first threshold is purely absolutely continuous.…

Mathematical Physics · Physics 2015-05-28 Walter H. Aschbacher , Jean-Marie Barbaroux , Jérémy Faupin , Jean-Claude Guillot

The spectrum of a complex-valued function $f$ on $\mathbb{Z}_{q}^n$ is the set $\{|u|:u\in \mathbb{Z}_q^n~\mathrm{and}~\widehat{f}(u)\neq 0\}$, where $|u|$ is the Hamming weight of $u$ and $\widehat{f}$ is the Fourier transform of $f$. Let…

Combinatorics · Mathematics 2024-04-17 Alexandr Valyuzhenich

We establish small correlation bounds for the Moebius function and the Walsh system, answering affirmatively a question posed by G.Kalai [Ka]. The argument is based on generalizing the approach of Mauduit and Rivat [M-R] in order to treat…

Number Theory · Mathematics 2011-09-14 Jean Bourgain

For convex and sequential effect algebras, we study spectrality in the sense of Foulis. We show that under additional conditions (strong archimedeanity, closedness in norm and a certain monotonicity property of the sequential product), such…

Quantum Physics · Physics 2023-12-21 Anna Jenčová , Sylvia Pulmannová

We prove that the Fourier dimension of any Boolean function with Fourier sparsity $s$ is at most $O\left(s^{2/3}\right)$. Our proof method yields an improved bound of $\widetilde{O}(\sqrt{s})$ assuming a conjecture of…

Computational Complexity · Computer Science 2014-07-15 Swagato Sanyal

Bent functions are Boolean functions that are maximally nonlinear. They can be represented as bent squares, i.e., square matrices for which each row and each column is the Walsh spectrum of a Boolean function. Using this representation, it…

Combinatorics · Mathematics 2025-09-09 Jan Kristian Haugland
‹ Prev 1 2 3 10 Next ›