English
Related papers

Related papers: FKN Theorem on the biased cube

200 papers

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

Interpolation and approximation of functionals with conditionally positive definite kernels is considered on sets of centers that are not determining for polynomials. It is shown that polynomial consistency is sufficient in order to define…

Numerical Analysis · Mathematics 2025-08-26 Oleg Davydov

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]$…

Computational Complexity · Computer Science 2013-04-05 Ryan O'Donnell , Li-Yang Tan

Using Fourier analysis, we study local limit theorems in weak-convergence problems. Among many applications, we discuss random matrix theory, some probabilistic models in number theory, the winding number of complex brownian motion and the…

Probability · Mathematics 2011-08-01 Freddy Delbaen , Emmanuel Kowalski , Ashkan Nikeghbali

We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order. In the extreme, we draw the coefficients from $\{ \pm 1\}$ only. A basic case of our results states that for…

Information Theory · Computer Science 2022-12-08 C. Sinan Güntürk , Weilin Li

We study a natural complexity measure of Boolean functions known as the rational degree. Denoted $\textrm{rdeg}(f)$, it is the minimal degree of a rational function that is equal to $f$ on the Boolean hypercube. For total functions $f$, it…

Computational Complexity · Computer Science 2025-04-16 Vishnu Iyer , Siddhartha Jain , Robin Kothari , Matt Kovacs-Deak , Vinayak M. Kumar , Luke Schaeffer , Daochen Wang , Michael Whitmeyer

We prove a Lusin approximation of functions of bounded variation. If $f$ is a function of bounded variation on an open set $\Omega\subset X$, where $X=(X,d,\mu)$ is a given complete doubling metric measure space supporting a $1$-Poincar\'e…

Functional Analysis · Mathematics 2025-01-14 Panu Lahti , Khanh Nguyen

In this paper, we propose the Fourier Discrepancy Function, a new discrepancy to compare discrete probability measures. We show that this discrepancy takes into account the geometry of the underlying space. We prove that the Fourier…

Machine Learning · Statistics 2021-11-19 Auricchio Gennaro , Codegoni Andrea , Gualandi Stefano , Zambon Lorenzo

The results presented in this paper are refinements of some results presented in a previous paper. Three such refined results are presented. The first one relaxes one of the basic hypotheses assumed in the previous paper, and thus extends…

Complex Variables · Mathematics 2015-05-06 Jorge L. deLyra

This paper is devoted to investigating the sequence of some linear functionals in the space $BV$ of finite variation functions. We prove that under certain conditions this sequence is bounded. We also prove that this result is sharp. In…

Functional Analysis · Mathematics 2023-08-09 L-E. Persson , V. Tsagareishvili , G. Tutberidze

Fourier extension is an approximation method that alleviates the periodicity requirements of Fourier series and avoids the Gibbs phenomenon when approximating functions. We describe a similar extension approach using regular wavelet bases…

Numerical Analysis · Mathematics 2020-04-08 Vincent Coppé , Daan Huybrechs

Mutually unbiased bases and discrete Wigner functions are closely, but not uniquely related. Such a connection becomes more interesting when the Hilbert space has a dimension that is a power of a prime $N=d^n$, which describes a composite…

Quantum Physics · Physics 2009-11-13 Gunnar Bjork , Jose L. Romero , Andrei B. Klimov , Luis L. Sanchez-Soto

We pursue a systematic study of the following problem. Let f:{0,1}^n -> {0,1} be a (usually monotone) Boolean function whose behaviour is well understood when the input bits are identically independently distributed. What can be said about…

Probability · Mathematics 2012-01-17 Itai Benjamini , Ori Gurel-Gurevich , Ron Peled

Rotation symmetric Boolean functions have important applications in the design of cryptographic algorithms. In this paper, the Conjecture about rotation symmetric Boolean functions (RSBFs) of degree 3 proposed by Cusik and St\u{a}nic\u{a}…

Cryptography and Security · Computer Science 2010-05-21 Xiyong Zhang , Hua Guo , Yifa Li

Given a submodular capacity space, we prove the uniform convergence in capacity and also the uniform convergence in the Choquet-mean of order $p\ge1$ with a quantitative estimate, of the multivariate Bernstein polynomials associated to a…

Classical Analysis and ODEs · Mathematics 2020-10-02 Sorin G. Gal , Constantin Niculescu

The celebrated union-closed conjecture is concerned with the cardinalities of various subsets of the Boolean $d$-cube. The cardinality of such a set is equivalent, up to a constant, to its measure under the uniform distribution, so we can…

Combinatorics · Mathematics 2025-11-05 Gabriel Gendler

In this note I present a readable version of the proof of my 2001 result, giving a sufficient and necessary condition for a function on a combinatorial cube to essentially (locally) depend on at most one variable (see the end of the paper…

Combinatorics · Mathematics 2025-03-12 Ilijas Farah

It is well known that a quadratic function defined on a finite field of odd degree is almost bent (AB) if and only if it is almost perfect nonlinear (APN). For the even degree case there is no apparent relationship between the values in the…

Information Theory · Computer Science 2008-12-01 Carl Bracken , Zhengbang Zha

We use Rankin--Cohen brackets on O(n, 2) to prove that the Fourier coefficients of reflective Borcherds products often satisfy congruences modulo certain primes.

Number Theory · Mathematics 2023-07-27 Haowu Wang , Brandon Williams

We prove a restricted projection theorem for Borel subsets of $\mathbb{Q}_p^n$ in the regime $p>n$. This generalizes results of Gan-Guo-Wang in the real setting. Our result is effective in the sense that explicit constants are obtained for…

Classical Analysis and ODEs · Mathematics 2024-07-01 Ben Johnsrude , Zuo Lin