相关论文: Some inequalities for Chebyshev polynomials

We define a class of multivariate Laurent polynomials closely related to Chebyshev polynomials, and prove the simple but somewhat surprising (in view of the fact that the signs of the coefficients of the Chebyshev polynomials themselves…

For any $k\geq 1$, this paper studies the number of polynomials having $k$ irreducible factors (counted with or without multiplicities) in $\mathbf{F}_q[t]$ among different arithmetic progressions. We obtain asymptotic formulas for the…

In this paper we produce seven new algebras as confluences of the Cherednik algebra of type \check{C_1}C_1 and we characterise their spherical-sub-algebras. The limit of the spherical sub-algebra of the Cherednik algebra of type…

We answer Totik's question on weighted Bernstein's inequalities showing that $$ \|T_n'\|_{L_p(\omega)} \le C(p,\omega)\, {n}\,\|T_n\|_{L_p(\omega)},\qquad 0<p\le \infty, $$ holds for all trigonometric polynomials $T_n$ and certain…

We prove non asymptotic linear convergence rates for the constrained Anderson acceleration extrapolation scheme. These guarantees come from new upper bounds on the constrained Chebyshev problem, which consists in minimizing the maximum…

Polynomials with coefficients in $\{-1,1\}$ are called Littlewood polynomials. Using special properties of the Rudin-Shapiro polynomials and classical results in approximation theory such as Jackson's Theorem, de la Vall\'ee Poussin sums,…

In this expository paper, we discuss a unified framework for proving various geometric inequalities, based on the so-called Alexandrov-Bakelman-Pucci technique. Examples include Cabr\'e's proof of the classical isoperimetric inequality in…

First we give here a simple proof of a remarkable result of Videnskii and Shirokov: let $B$ be a Blaschke product with $n$ zeros, then there exists an outer function $\phi, \phi(0)=1$, such that $\|(B\phi)'\| \leq C n$, where $C$ is an…

There are many results on the simultaneous approximation by sequences of special positive linear operators. In the year 1978, Ismail and May as well as Volkov independently studied operators of exponential type covering the most classical…

A conjecture of I. Krasikov is proved. Several discrete analogues of classical polynomial inequalities are derived, along with results which allow extensions to a class of transcendental entire functions in the Laguerre-P\'olya class.

It is well-known that for every $N \geq 1$ and $d \geq 1$ there exist point sets $x_1, \dots, x_N \in [0,1]^d$ whose discrepancy with respect to the Lebesgue measure is of order at most $(\log N)^{d-1} N^{-1}$. In a more general setting,…

An explicit structure relation for Askey-Wilson polynomials is given. This involves a divided q-difference operator which is skew symmetric with respect to the Askey-Wilson inner product and which sends polynomials of degree n to…

We establish a family of parametric isoperimetric-type inequalities with multiple geometric quantities for closed convex curves. These inequalities hold under certain parameter conditions. We also prove the equality conditions. Some new…

For each $n$, let $\text{RD}(n)$ denote the minimum $d$ for which there exists a formula for the general polynomial of degree $n$ in algebraic functions of at most $d$ variables. In 1945, Segre called for a better understanding of the large…

We generalize an inequality conjectured by Pohst in 1977 and recently proved by the author and independently by Battistoni and Molteni. This new inequality improves a bound for the regulator in terms of the discriminant for totally real…

Let ~$\veps_1, ..., \veps_m$ be i.i.d. random variables with $$P(\veps_i=1)= P(\veps_i= -1)=1/2,$$ and $X_m = \sum_{i=1}^m \veps_i.$ Let $Y_m $ be a normal random variable with the same first two moments as that of $X_m.$ There is a…

In this paper we follow the general approach, proposed earlier by the first author, which is derived from the invariant theory field and provides a way of obtaining of the polynomial identities for any arbitrary polynomial family. We…

Treating high dimensionality is one of the main challenges in the development of computational methods for solving problems arising in finance, where tasks such as pricing, calibration, and risk assessment need to be performed accurately…

Let $P(z)$ be a polynomial of degree $n$. In $2004$, Aziz and Rather \cite{aziz2004some} investigated the dependence of \[\bigg|P(Rz)-\alpha P(z)+\beta\biggl\{\biggl(\frac{R+1}{2}\biggr)^n-|\alpha|\biggr\}P(z)\bigg|, \ \text{for} \ z \in…

In this article, we give a complex-geometric proof of the Alexandrov-Fenchel inequality without using toric compactifications. The idea is to use the Legendre transform and develop the Brascamp-Lieb proof of the Pr\'ekopa theorem. New…