English
Related papers

Related papers: FKN, first proof, rewritten

200 papers

We derive and showcase a novel approach to approximating Fourier transforms in higher dimensions, focusing specifically on the case of 2D radially concentrated ('ring-like') functions. We first reduce the problem to that of evaluating the…

High Energy Astrophysical Phenomena · Physics 2026-04-08 Filip Niewiński , Michael D. Johnson

Bourgain showed that any noise stable Boolean function $f$ can be well-approximated by a junta. In this note we give an exponential sharpening of the parameters of Bourgain's result under the additional assumption that $f$ is a halfspace.

Computational Complexity · Computer Science 2012-03-01 Ilias Diakonikolas , Ragesh Jaiswal , Rocco A. Servedio , Li-Yang Tan , Andrew Wan

Motivated by various problems in physics and applied mathematics, we look for constraints and properties of real Fourier-positive functions, i.e. with positive Fourier transforms. Properties of the "Dirac comb" distribution and of its…

Mathematical Physics · Physics 2016-05-25 Bertrand G. Giraud , Robi Peschanski

A function $F:\mathbb{F}_2^n\rightarrow \mathbb{F}_2^n$, $n=2m$, can have at most $2^n-2^m$ bent component functions. Trivial examples are obtained as $F(x) = (f_1(x),\ldots,f_m(x),a_1(x),\ldots, a_m(x))$, where…

Number Theory · Mathematics 2020-10-09 Nurdagül Anbar , Tekgül Kalaycı , Wilfried Meidl , László Mérai

We study the Fourier spectrum of functions $f\colon \{0,1\}^{mk} \to \{-1,0,1\}$ which can be written as a product of $k$ Boolean functions $f_i$ on disjoint $m$-bit inputs. We prove that for every positive integer $d$, \[ \sum_{S \subseteq…

Computational Complexity · Computer Science 2019-02-08 Chin Ho Lee

We study concentration operators acting on the Fourier symmetric Sobolev space $H$ consisting of functions $f$ such that $\int_{\mathbb{R}} |f(x)|^2(1+x^2) dx + \int_{\mathbb{R}} |\hat{f}(\xi)|^2(1+\xi^2) d\xi < \infty $. We find that the…

Classical Analysis and ODEs · Mathematics 2026-03-19 Denis Zelent

In some applications, one is interested in reconstructing a function $f$ from its Fourier series coefficients. The problem is that the Fourier series is slowly convergent if the function is non-periodic, or is non-smooth. In this paper, we…

Numerical Analysis · Mathematics 2020-04-14 David Levin

A trigonometric series strongly bounded at two points and with coefficients forming a log-quasidecreasing sequence is necessarily the Fourier series of a function belonging to all $L^{p}$ spaces, $1\leq p < \infty$. We obtain new results on…

Classical Analysis and ODEs · Mathematics 2017-04-24 Muharem Avdispahić , Zenan Šabanac

Fourier Transforms is a first in a series of monographs we present on harmonic analysis. Harmonic analysis is one of the most fascinating areas of research in mathematics. Its centrality in the development of many areas of mathematics such…

Classical Analysis and ODEs · Mathematics 2017-09-12 Kecheng Zhou , Vali Siadat

We show the pointwise convergence of the averages \[ \mathcal{A}_N f(x) = \frac{1}{\# \mathbf{B}_N} \sum_{n \in \mathbf{B}_N} f(x + n) \] for $f \in \ell^1(\mathbb{Z})$ where $\mathbf{B}_N = \mathbf{B} \cap [1, N]$, and $\mathbf{B}$ is a…

Number Theory · Mathematics 2020-12-21 Bartosz Trojan

Generalisations of the bent property of a boolean function are presented, by proposing spectral analysis with respect to a well-chosen set of local unitary transforms. Quadratic boolean functions are related to simple graphs and it is shown…

Information Theory · Computer Science 2007-07-13 Constanza Riera , Matthew G. Parker

This paper contains the proof of Macdonald's duality and evaluation conjectures, the definition of the difference Fourier transform, the recurrence theorem generalizing Pieri rules, and the action of GL(2,Z) on the Macdonald polynomials at…

q-alg · Mathematics 2009-10-28 Ivan Cherednik

Functions with fixed initial coefficient have been widely studied. A new methodology is proposed in this paper by making appropriate modifications and improvements to the theory of second-order differential subordination. Several…

Complex Variables · Mathematics 2012-08-02 Rosihan M. Ali , Sumit Nagpal , V. Ravichandran

A fuzzy Boolean function is a map $f:\cube^n\to [0,1]$, where $n\in\mathbb N$. We introduce and compare three ways of saying that such a function has bounded complexity. The first is a sampling property: the value $f(x)$ can be recovered,…

Combinatorics · Mathematics 2026-05-22 Balazs Szegedy

We study the $n^{\rm th}$ centered moments of the $1$-level density for the low-lying zeros of $L$-functions attached to holomorphic cuspidal newforms of large prime level and fixed weight. Assuming the Generalized Riemann Hypotheses, we…

In this paper, we have proved four theorems on the degree of approximation of continuous functions by matrix means of their Fourier series which is expressed in terms of the modulus of continuity and a non-negative mediate function.

Classical Analysis and ODEs · Mathematics 2023-06-22 Xhevat Z. Krasniqi

In this paper, we first give two uniform asymptotic approximations of the eigenfunctions of the weighted finite Fourier transform operator, defined by ${\displaystyle \mathcal F_c^{(\alpha)} f(x)=\int_{-1}^1 e^{icxy}…

Classical Analysis and ODEs · Mathematics 2017-05-03 Abderrazek Karoui , Ahmed Souabni

This notes explains how a standard algorithm that constructs the discrete Fourier transform has been formalised and proved correct in the Coq proof assistant using the SSReflect extension.

Logic in Computer Science · Computer Science 2025-08-15 Laurent Théry

The Fourier transform of a bounded measurable function, $f$, on the real line is shown to be the second distributional derivative of a H\"older continuous function. The Fourier transform is written as the difference of $\int_{-1}^1…

Classical Analysis and ODEs · Mathematics 2026-01-26 Erik Talvila

We show a partial Boolean function $f$ together with an input $x\in f^{-1}\left(*\right)$ such that both $C_{\bar{0}}\left(f,x\right)$ and $C_{\bar{1}}\left(f,x\right)$ are at least $C\left(f\right)^{2-o\left(1\right)}$. Due to recent…

Computational Complexity · Computer Science 2021-03-10 Kaspars Balodis