Related papers: A structure theorem for almost low-degree function…

We use weighted polynomial approximation to prove the existence of a compact set K with non-empty interior and a function f is dense in the space A(K) of all continuous functions on K that are holomorphic in the interior of K, endowed with…

In this paper we investigate the principle of the generalised localisation for spectral expansions of the polyharmonic operator, which coincides with the multiple Fourier integrals summed over the domains corresponding to the surface levels…

We provide some conditions for the graph of a Hoelder-continuous function on \bar{D}, where \bar{D} is a closed disc in the complex plane, to be polynomially convex. Almost all sufficient conditions known to date --- provided the function…

A function $f:\mathbb{Z}_n \to \mathbb{C}$ can be represented as a linear combination $f(x)=\sum_{\alpha \in \mathbb{Z}_n}\widehat{f}(\alpha) \chi_{\alpha,n}(x)$ where $\widehat{f}$ is the (discrete) Fourier transform of $f$. Clearly, the…

Let $\Omega\subset\mathbb{R}^n$ be a bounded $(\varepsilon,\infty)$-domain with $\varepsilon\in(0,1]$, $X(\mathbb{R}^n)$ a ball Banach function space satisfying some extra mild assumptions, and $\{\rho_\nu\}_{\nu\in(0,\nu_0)}$ with…

We prove lower bounds for the Minimum Circuit Size Problem (MCSP) in the Sum-of-Squares (SoS) proof system. Our main result is that for every Boolean function $f: \{0,1\}^n \rightarrow \{0,1\}$, SoS requires degree $\Omega(s^{1-\epsilon})$…

In this paper we approximate high-dimensional functions $f\colon\mathbb T^d\to\mathbb C$ by sparse trigonometric polynomials based on function evaluations. Recently it was shown that a dimension-incremental sparse Fourier transform (SFT)…

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…

Polynomial approximations to boolean functions have led to many positive results in computer science. In particular, polynomial approximations to the sign function underly algorithms for agnostically learning halfspaces, as well as…

We give a proof of Fourier extension conjecture on the paraboloid in all dimensions bigger than 2 that begins with a decomposition suggested in Sawyer [Saw8] of writing a smooth Alpert projection as a sum of pieces whose Fourier extensions…

A Boolean function $f:\{0,1\}^n\to \{0,1\}$ is $k$-linear if it returns the sum (over the binary field $F_2$) of $k$ coordinates of the input. In this paper, we study property testing of the classes $k$-Linear, the class of all $k$-linear…

This paper presents a quadratic formula-based nonlinear representation for a given single-variable function f(x), $-1 \leq x \leq 1$. First, we construct the explicit polynomial coefficient functions a(x), b(x), and c(x) using a…

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…

We study functions on the infinite-dimensional Hamming cube $\{-1,1\}^\infty$, in particular Boolean functions into $\{-1,1\}$, generalising results on analysis of Boolean functions on $\{-1,1\}^n$ for $n\in\mathbb{N}$. The notion of noise…

In this note, the polar decomposition of binary fields of even extension degree is used to reduce the evaluation of the Walsh transform of binomial Boolean functions to that of Gauss sums. In the case of extensions of degree four times an…

Let F be a class of functions with the uniqueness property: if a function f in F vanishes on a set of positive measure, then f is the zero function. In many instances, we would like to have a quantitative version of this property, e.g. a…

A nearest neighbor representation of a Boolean function $f$ is a set of vectors (anchors) labeled by $0$ or $1$ such that $f(\vec{x}) = 1$ if and only if the closest anchor to $\vec{x}$ is labeled by $1$. This model was introduced by…

We show that there is a simple (approximately radial) function on $\reals^d$, expressible by a small 3-layer feedforward neural networks, which cannot be approximated by any 2-layer network, to more than a certain constant accuracy, unless…

A function $f$ is $d$-resilient if all its Fourier coefficients of degree at most $d$ are zero, i.e., $f$ is uncorrelated with all low-degree parities. We study the notion of $\mathit{approximate}$ $\mathit{resilience}$ of Boolean…

Fixed a continuous kernel K on the $d$-dimensional torus, we consider a generalization of the univariate $sk$-spline to the torus, associated with the kernel K. It is proved an estimate which provides the rate of convergence of a given…