Related papers: Asymptotic Coefficients and Errors for Chebyshev P…

We introduce quantized Chebyshev polynomials as deformations of generalized Chebyshev polynomials previously introduced by the author in the context of acyclic coefficient-free cluster algebras. We prove that these quantized polynomials…

For "Riesz-like" kernels $K(x,y)=f(|x-y|)$ on $A\times A$, where $A$ is a compact $d$-regular set $A\subset \mathbb{R}^p$, we prove a minimum principle for potentials $U_K^\mu=\int K(x,y)d\mu(x)$, where $\mu$ is a Borel measure supported on…

We consider periodic homogenization with localized defects for semilinear elliptic equations and systems of the type $$ \nabla\cdot\Big(\Big(A(x/\varepsilon)+B(x/\varepsilon)\Big)\nabla u(x)+c(x,u(x)\Big)=d(x,u(x)) \mbox{ in } \Omega $$…

Tusn\'ady's problem asks to bound the discrepancy of points and axis-parallel boxes in $\mathbb{R}^d$. Algorithmic bounds on Tusn\'ady's problem use a canonical decomposition of Matou\v{s}ek for the system of points and axis-parallel boxes,…

Itsykson and Sokolov [IS14] identified resolution over parities, denoted by $\text{Res}(\oplus)$, as a natural and simple fragment of $\text{AC}^0[2]$-Frege for which no super-polynomial lower bounds on size of proofs are known. Building on…

As one myth of polynomial interpolation and quadrature, Trefethen [30] revealed that the Chebyshev interpolation of $|x-a|$ (with $|a|<1 $) at the Clenshaw-Curtis points exhibited a much smaller error than the best polynomial approximation…

A variant of the well-known Chebyshev inequality for scalar random variables can be formulated in the case where the mean and variance are estimated from samples. In this paper we present a generalization of this result to multiple…

Trigonometric polynomials are usually defined on the lattice of integers.We consider the larger class of weight and root lattices with crystallographic symmetry.This article gives a new approach to minimize trigonometric polynomials, which…

Let $\mathcal{O}\subset\mathbb{R}^d$ be a bounded domain of class $C^{1,1}$. In $L_2(\mathcal{O};\mathbb{C}^n)$, we study a selfadjoint matrix elliptic second order differential operator $B_{D,\varepsilon}$, $0<\varepsilon\leqslant 1$, with…

Let $\mathcal{O} \subset \mathbb{R}^d$ be a bounded domain of class $C^2$. In the Hilbert space $L_2(\mathcal{O};\mathbb{C}^n)$, we consider a matrix elliptic second order differential operator $\mathcal{A}_{D,\varepsilon}$ with the…

In approximation theory, it is standard to approximate functions by polynomials expressed in the Chebyshev basis. Evaluating a polynomial $f$ of degree n given in the Chebyshev basis can be done in $O(n)$ arithmetic operations using the…

We obtain Riesz transform bounds and characterise operator-adapted Hardy spaces to solve boundary value problems for singular Schr\"odinger equations $-\mathrm{div}(A\nabla u)+aVu=0$ in the upper half-space $\mathbb{R}^{1+n}_{+}$ with…

We extend the method of layer potentials to manifolds with boundary and cylindrical ends. To obtain this extension along the classical lines, we have to deal with several technical difficulties due to the non-compactness of the boundary,…

In this paper, we derive new probability bounds for Chebyshev's inequality if the supremum of the probability density function is known. This result holds for one-dimensional or multivariate continuous probability distributions with finite…

Chernoff bounds are a powerful application of the Markov inequality to produce strong bounds on the tails of probability distributions. They are often used to bound the tail probabilities of sums of Poisson trials, or in regression to…

In this paper, we investigate the Dirichlet problem on lower dimensional manifolds for a class of weighted elliptic equations with coefficients that are singular on such sets. Specifically, we study the problem \[\begin{cases} -{\rm…

This is the continuation of previous article. For subspaces $M^n(t)$ and $M^{n-m}(t)$ which are invariant manifolds of the differential equation under consideration we build a change of variables which splits this equation into a system of…

A fundamental problem in numerical analysis and approximation theory is approximating smooth functions by polynomials. A much harder version under recent consideration is to enforce bounds constraints on the approximating polynomial. In…

Estimating the Domain of Attraction (DA) of non-polynomial systems is a challenging problem. Taylor expansion is widely adopted for transforming a nonlinear analytic function into a polynomial function, but the performance of Taylor…

The original Grover's algorithm suffers from the souffle problem, which means that the success probability of quantum search decreases dramatically if the iteration time is too small or too large from the right time. To overcome the souffle…