Related papers: Monic integer Chebyshev problem

Finding point configurations, that yield the maximum polarization (Chebyshev constant) is gaining interest in the field of geometric optimization. In the present article, we study the problem of unconstrained maximum polarization on compact…

The article is concerned with polynomials $g(x)$ whose graphs are "partially packed" between two horizontal tangent lines. We assume that most of the local maximum points of $g(x)$ are on the first horizontal line, and most of the local…

For $N \in \mathbb{N}$, let $T_{N}$ be the Chebyshev polynomial of the first kind. Expressions for the sequence of numbers $p_{\ell}^{(N)}$, defined as the coefficients in the expansion of $1/T_{N}(1/z)$, are provided. These coefficients…

Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on…

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…

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…

In this paper, we introduce the class of $(\beta,\gamma)$-Chebyshev functions and corresponding points, which can be seen as a family of {\it generalized} Chebyshev polynomials and points. For the $(\beta,\gamma)$-Chebyshev functions, we…

We show that any submodular minimization (SM) problem defined on a linear constraint set with constraints having up to two variables per inequality, are 2-approximable in polynomial time. If the constraints are monotone (the two variables…

Motivated by the product formula of the Chebyshev polynomials of the second kind $U_n(x)$, we newly introduce the partial Chebyshev polynomials $U^{\mathrm{e}}_n(x)$ and $U^{\mathrm{o}}_n(x)$ and derive their basic properties, relations to…

A great variety of fundamental optimization and counting problems arising in computer science, mathematics and physics can be reduced to one of the following computational tasks involving polynomials and set systems: given an $m$-variate…

There is a vast theory of Chebyshev and residual polynomials and their asymptotic behavior. The former ones maximize the leading coefficient and the latter ones maximize the point evaluation with respect to an $L^\infty$ norm. We study…

In this paper, we establish some nontrivial and effective upper bounds for the least common multiple of consecutive terms of a finite arithmetic progression. Precisely, we prove that for any two coprime positive integers $a$ and $b$, with…

We study weighted Chebyshev polynomials on compact subsets of the complex plane with respect to a bounded weight function. We establish existence and uniqueness of weighted Chebyshev polynomials and derive weighted analogs of Kolmogorov's…

We study the problem of robust multivariate polynomial regression: let $p\colon\mathbb{R}^n\to\mathbb{R}$ be an unknown $n$-variate polynomial of degree at most $d$ in each variable. We are given as input a set of random samples…

We study residual polynomials, $R_{x_0,n}^{(\mathfrak{e})}$, $\mathfrak{e}\subset\mathbb{R}$, $x_0\in\mathbb{R}\setminus\mathfrak{e}$, which are the degree at most $n$ polynomials with $R(x_0)=1$ that minimize the $\sup$ norm on…

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…

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…

We discuss the minimization of a Kohler-Jobin type scale-invariant functional among open, convex, bounded sets, namely $\min T_2(\Omega) ^{\frac{1}{N+2}}h_1(\Omega)$ among open convex bounded sets $\Omega \subset \mathbb R^N$, where…

We study two types of problems for polynomial Farey fractions. For a positive integer $Q$, and polynomial $P(x)\in\mathbb{Z}[X]$ with $P(0)=0$, we define polynomial Farey fractions as \[\mathcal{F}_{Q,P}:=\left\{\frac{a}{q}: 1\leq a\leq…

We consider the problem of approximating an analytic function on a compact interval from its values at $M+1$ distinct points. When the points are equispaced, a recent result (the so-called impossibility theorem) has shown that the best…