Related papers: On the weighted trigonometric Bojanov-Chebyshev ex…

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…

Given a compact subset of a Banach space, the Chebyshev center problem consists of finding a minimal circumscribing ball containing the set. In this article we establish a numerically tractable algorithm for solving the Chebyshev center…

The joint bidiagonalization process of a matrix pair $\{A,L\}$ can be used to develop iterative regularization algorithms for large scale ill-posed problems in general-form Tikhonov regularization…

Fourier series in orthogonal polynomials with respect to a measure $\nu$ on $[-1,1]$ are studied when $\nu$ is a linear combination of a generalized Jacobi weight and finitely many Dirac deltas in $[-1,1]$. We prove some weighted norm…

We continue our study of the Widom factors for $L_p(\mu)$ extremal polynomials initiated in [4]. In this work we characterize sets for which the lower bounds obtained in [4] are saturated, establish continuity of the Widom factors with…

Chebyshev varieties are algebraic varieties parametrized by Chebyshev polynomials or their multivariate generalizations. We determine the dimension, degree, singular locus and defining equations of these varieties. We explain how they play…

Tikhonov regularization for projected solutions of large-scale ill-posed problems is considered. The Golub-Kahan iterative bidiagonalization is used to project the problem onto a subspace and regularization then applied to find a subspace…

For the class of sine polynomials $b_1\sin t+b_2\sin2t+...+b_N\sin Nt,\; (b_N\not= 0),$ which are nonnegative on $(0,\pi)$, W. Rogosinski and G. Szeg\"o derived, among other things, exact bounds for $|b_2|$ via the Luk\'acs presentation of…

We consider problems in which we are given a rooted tree as input, and must find a subtree with the same root, optimizing some objective function of the nodes in the subtree. When this function is the sum of constant node weights, the…

Given $n$ polynomials $p_1, \dots, p_n$ of degree at most $n$ with $\|p_i\|_\infty \le 1$ for $i \in [n]$, we show there exist signs $x_1, \dots, x_n \in \{-1,1\}$ so that \[\Big\|\sum_{i=1}^n x_i p_i\Big\|_\infty < 30\sqrt{n}, \] where…

We consider a new multivariate generalization of the classical monic (univariate) Chebyshev polynomial that minimizes the uniform norm on the interval $[-1,1]$. Let $\Pi^*_n$ be the subset of polynomials of degree at most $n$ in $d$…

We consider the maximum weight $b$-matching problem in the random-order semi-streaming model. Assuming all weights are small integers drawn from $[1,W]$, we present a $2 - \frac{1}{2W} + \varepsilon$ approximation algorithm, using a memory…

For linear inverse problem with Gaussian random noise we show that Tikhonov regularization algorithm is minimax in the class of linear estimators and is asymptotically minimax in the sense of sharp asymptotic in the class of all estimators.…

We employ the generalized Remez algorithm, initially suggested by P. T. P. Tang, to perform an experimental study of Chebyshev polynomials in the complex plane. Our focus lies particularly on the examination of their norms and zeros. What…

Consider a real line equipped with a (not necessarily intrinsic) distance. We deal with the minimum-weight perfect matching problem for a complete graph whose points are located on the line and whose edges have weights equal to distances…

We prove a constant term theorem which is useful for finding weight polynomials for Ballot/Motzkin paths in a strip with a fixed number of arbitrary `decorated' weights as well as an arbitrary `background' weight. Our CT theorem, like…

We consider Chebyshev polynomials, $T_n(z)$, for infinite, compact sets $\frak{e} \subset \mathbb{R}$ (that is, the monic polynomials minimizing the sup-norm, $\Vert T_n \Vert_{\frak{e}}$, on $\frak{e}$). We resolve a $45+$ year old…

In this manuscript, we analyze the expansions of functions in orthogonal polynomials associated with a general weight function in a multidimensional setting. Such orthogonal polynomials can be obtained by Gram-Schmidt orthogonalization.…

We propose a general method to construct symmetric tensor polynomials in the D-dimensional Euclidean space which are orthonormal under a general weight. The D-dimensional Hermite polynomials are a particular case of the present ones for the…

We consider random trigonometric polynomials of the form \[ f_n(x,y)=\sum_{1\le k,l \le n} a_{k,l} \cos(kx) \cos(ly), \] where the entries $(a_{k,l})_{k,l\ge 1}$ are i.i.d. random variables that are centered with unit variance. We…