Related papers: The Gibbs phenomenon for the Krawtchouk polynomial…
When a function $f(x)$ is singular at a point $x_{s}$ on the real axis, its Fourier series, when truncated at the $N$-th term, gives a pointwise error of only $O(1/N)$ over the entire real axis. Such singularities spontaneously arise as…
We study the well-known Label Cover problem under the additional requirement that problem instances have large girth. We show that if the girth is some $k$, the problem is roughly $2^{\log^{1-\epsilon} n/k}$ hard to approximate for all…
Functions that are smooth but non-periodic on a certain interval possess Fourier series that lack uniform convergence and suffer from the Gibbs phenomenon. However, they can be represented accurately by a Fourier series that is periodic on…
We study the polynomial approximation problem in $L^2(\mu_1)$ where $\mu_1(dx) = e^{-|x|}/2 dx$. We show that for any absolutely continuous function $f$, $$ \sum_{k=1}^{\infty} \log^2(e+k) \langle f, P_k \rangle^2 \ \leq C \left(…
We establish a universality law for sequences of functions $\{w_n\}_{n \in \mathbb{N}}$ satisfying a form of WKB approximation on compact intervals. This includes eigenfunctions of generic Schr\"odinger operators, as well as Laguerre and…
We consider the orthogonal polynomials $\{P_{n}(z)\}$ with respect to the measure $|z-a|^{2N c} {\rm e}^{-N |z|^2} \,{\rm d} A(z)$ over the whole complex plane. We obtain the strong asymptotic of the orthogonal polynomials in the complex…
In this paper, we show that there exists a balanced linear threshold function (LTF) which is unique games hard to approximate, refuting a conjecture of Austrin, Benabbas, and Magen. We also show that the almost monarchy predicate on k…
We prove effective results on when a function can be approximated by a Dirichlet polynomial with bounded coefficients. Assuming that \Phi(n) is an increasing function we prove that the set of polynomials {\sum_{n=2}^N a_n n^{it-1}: N \geq…
We aim to fill a gap in the proof of an inequality relating two exponents of uniform Diophantine approximation stated in a paper by Bugeaud. We succeed to verify the inequality in several instances, in particular for small dimension.…
With every real polynomial $f$, we associate a family $\{f_{\epsilon r}\}_{\epsilon, r}$ of real polynomials, in explicit form in terms of $f$ and the parameters $\epsilon>0,r\in N$, and such that $\Vert f-f_{\epsilon r}\Vert_1\to 0$ as…
The paper establishes a functional version of the Hoeffding combinatorial central limit theorem. First, a pre-limiting Gaussian process approximation is defined, and is shown to be at a distance of the order of the Lyapounov ratio from the…
In this paper, we prove that it is W[2]-hard to approximate k-SetCover within any constant ratio. Our proof is built upon the recently developed threshold graph composition technique. We propose a strong notion of threshold graphs and use a…
Fourier extension is an approximation scheme in which a function on an arbitary bounded domain is approximated using a classical Fourier series on a bounding box. On the smaller domain the Fourier series exhibits redundancy, and it has the…
Under the generalized Riemann Hypothesis (GRH), Baluyot, Chandee, and Li nearly doubled the range in which the density of low lying zeros predicted by Katz and Sarnak is known to hold for a large family of automorphic $L$-functions with…
The Fourier restriction phenomenon and the size of Kakeya sets are explored in the setting of the ring of integers modulo $N$ for general $N$ and a striking similarity with the corresponding euclidean problems is observed. One should…
We study a conjecture called "linear rank conjecture" recently raised in (Tsang et al., FOCS'13), which asserts that if many linear constraints are required to lower the degree of a GF(2) polynomial, then the Fourier sparsity (i.e. number…
The convergence rates on polynomial interpolation in most cases are estimated by Lebesgue constants. These estimates may be overestimated for some special points of sets for functions of limited regularities. In this paper, by applying the…
We give an example of a function $f$ non-vanishing in the closed bidisk and the affine polynomial minimizing the norm of $1-pf$ in the Hardy space of the bidisk among all affine polynomials $p$. We show that this polynomial vanishes inside…
In this paper, we will present a strong (or pathwise) approximation of standard Brownian motion by a class of orthogonal polynomials. The coefficients that are obtained from the expansion of Brownian motion in this polynomial basis are…
In this paper we consider the problem of approximating function evaluations $f(\boldsymbol x_j)$ at given nonequispaced points $\boldsymbol x_j$, $j=1,\dots N$, of a bandlimited function from given values $\hat{f}(\boldsymbol k)$,…