Related papers: Logarithmic Derivatives of Least Deviation from Ze…

In this short note we prove the logarithmic Sobolev inequality with derivatives of fractional order on $\mathbb{R}^n$ with an explicit expression for the constant. Namely, we show that for all $0<s<\frac{n}{2}$ and $a>0$ we have the…

The Cheap Gradient Principle (Griewank 2008) --- the computational cost of computing the gradient of a scalar-valued function is nearly the same (often within a factor of $5$) as that of simply computing the function itself --- is of…

We prove that the convergence of the real and imaginary parts of the logarithm of the characteristic polynomial of unitary Brownian motion toward Gaussian free fields on the cylinder, as the matrix dimension goes to infinity, holds in…

In this paper we shall use the boundary Schwarz lemma of Osserman to obtain some generalizations and refinements of some well known results concerning the maximum modulus of the polynomials with restricted zeros due to Turan, Dubinin and…

The series expansion of $x^m (-\log x)^l$ in terms of the shifted Chebyshev Polynomials $T_n^*(x)$ requires evaluation of the integral family $\int_0^1 x^m (-\log x)^l dx / \sqrt{x-x^2}$. We demonstrate that these can be reduced by partial…

We announce some new results on the convergence of Chebyshev--Pad\'e approximations to real-valued algebraic function given on the segment $[-1,1]$. The rate of convergence on the segment and in the corresponding maximal domain of…

In this paper, we provide a criterion on uniform large deviation principles (ULDP) for stochastic differential equations under locally weak monotone conditions and Lyapunov conditions, which can be applied to stochastic systems with…

A heuristic formula for 5-point approximation of the first derivative of an unknown function whose values are measured with an error at unequally spaced points is proposed. The derivative at a given point is calculated using the effective…

A wide range of numerical methods exists for computing polynomial approximations of solutions of ordinary differential equations based on Chebyshev series expansions or Chebyshev interpolation polynomials. We consider the application of…

The paper provides an estimate of the total variation distance between distributions of polynomials defined on a space equipped with a logarithmically concave measure in terms of the $L^2$-distance between these polynomials.

We show that for any uniformly parabolic fully nonlinear second-order equation with bounded measurable "coefficients" and bounded "free" term in any cylindrical smooth domain with smooth boundary data one can find an approximating equation…

The probability that a zero of a random real polynomial of increasing degree is real tends to zero. However, passing from polynomials to Laurent polynomials yields a surprising result: the probability that a root is real tends not to zero,…

It is a classical result in rational approximation theory that certain non-smooth or singular functions, such as $|x|$ and $x^{1/p}$, can be efficiently approximated using rational functions with root-exponential convergence in terms of…

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…

In this paper, we study the optimal general convergence rates for quadratures derived from Chebyshev points. By building on the aliasing errors on integration of Chebyshev polynomials, together with the asymptotic formulae on the…

We present a survey of central developments in the theory of Chebyshev polynomials, introduced by P.~L.~Chebyshev and later extended to the complex plane by G.~Faber. Our primary focus is their defining extremal property: among all…

A study of the greatest possible ratio of the smallest absolute value of a higher derivative of some function, defined on a bounded interval, to the L p-norm of the function.

For the basic maximum likelihood estimating function of the two parameters Weibull distribution, a simple proof on its global monotonicity is given to ensure the existence and uniqueness of its solution. The boundary of the function's…

We examine the necessary and sufficient complexity of neural networks to approximate functions from different smoothness spaces under the restriction of encodable network weights. Based on an entropy argument, we start by proving lower…

The Borichev--Tomilov theorem \cite{BT2010} provides a sharp characterization of polynomial decay for linear $C_0$-semigroups in terms of resolvent growth along the imaginary axis. In the nonlinear setting, the absence of a spectral theory…