Related papers: A new estimate for a quantity involving the Chebys…

In this paper, we develop a general approach for probabilistic estimation and optimization. An explicit formula and a computational approach are established for controlling the reliability of probabilistic estimation based on a mixed…

Due to their importance in both data analysis and numerical algorithms, low rank approximations have recently been widely studied. They enable the handling of very large matrices. Tight error bounds for the computationally efficient…

We give a new bound on the number of collinear triples for two arbitrary subsets of a finite field. This improves on existing results which rely on the Cauchy inequality. We then us this to provide a new bound on trilinear and quadrilinear…

State-of-the-art methods in convex and non-convex optimization employ higher-order derivative information, either implicitly or explicitly. We explore the limitations of higher-order optimization and prove that even for convex optimization,…

Some identities of Chebyshev polynomials are deduced from Waring's formula on symmetric functions. In particular, these formulae generalize some recent results of Grabner and Prodinger.

In this paper we develop an optimisation based approach to multivariate Chebyshev approximation on a finite grid. We consider two models: multivariate polynomial approximation and multivariate generalised rational approximation. In the…

We present a new algorithm for finding isolated zeros of a system of real-valued functions in a bounded interval in $\mathbb{R}^n$. It uses the Chebyshev proxy method combined with a mixture of subdivision, reduction methods, and…

In this article we provide new explicit Chebyshev's bounds for the prime counting function $\psi(x)$. The proof relies on two new arguments: smoothing the prime counting function which allows to generalize the previous approaches, and a new…

Group-invariant probability distributions appear in many data-generative models in machine learning, such as graphs, point clouds, and images. In practice, one often needs to estimate divergences between such distributions. In this work, we…

We provide optimal upper bounds on the growth of iterated sumsets $hA=A+\dots+A$ for finite subsets $A$ of abelian semigroups. More precisely, we show that the new upper bounds recently derived from Macaulay's theorem in commutative algebra…

In this survey we consider polynomial optimization problems, asking to minimize a polynomial function over a compact semialgebraic set, defined by polynomial inequalities. This models a great variety of (in general, nonlinear nonconvex)…

Chebyshev polynomials of the first and second kind for a set K are monic polynomials with minimal L $\infty$-and L 1-norm on K, respectively. This articles presents numerical procedures based on semidefinite programming to compute these…

Gauss--Christoffel quadrature is a fundamental method for numerical integration, and its convergence analysis is closely related to the decay of Chebyshev expansion coefficients. Classical estimates, including those due to Trefethen, are…

In the present paper, a new subclass of analytic and bi-univalent functions by means of Chebyshev polynomials is introduced. Certain coefficient bounds for functions belong to this subclass are obtained. Furthermore, the Fekete-Szego…

We show that even mild improvements of the Polya-Vinogradov inequality would imply significant improvements of Burgess' bound on character sums. Our main ingredients are a lower bound on certain types of character sums (coming from works of…

In this paper we obtain further improvement of index bounds for character sums of polynomials over finite fields. We present some examples, which show that our new bound is an improved bound compared to both the Weil bound and the index…

We investigate border ranks of twisted powers of polynomials and smoothability of symmetric powers of algebras. We prove that the latter are smoothable. For the former, we obtain upper bounds for the border rank in general and prove that…

We provide a monotone non increasing sequence of upper bounds $f^H_k$ ($k\ge 1$) converging to the global minimum of a polynomial $f$ on simple sets like the unit hypercube. The novelty with respect to the converging sequence of upper…

We derive new integral estimates on substatic manifolds with boundary of horizon type, naturally arising in General Relativity. In particular, we generalize to this setting an identity due to Magnanini-Poggesi leading to the Alexandrov…

For a function that is analytic on and around an interval, Chebyshev polynomial interpolation provides spectral convergence. However, if the function has a singularity close to the interval, the rate of convergence is near one. In these…