Related papers: Estimating the Koebe radius for polynomials

For the univalent polynomials $F(z) = \sum\limits_{j=1}^{N} a_j z^{2j-1}$ with real coefficients and normalization \(a_1 = 1\) we solve the extremal problem \[ \min_{a_j:\,a_1=1} \left( -iF(i) \right) = \min_{a_j:\,a_1=1}…

The Koebe problem for univalent polynomials with real coefficients is fully solved only for trinomials, which means that in this case the Koebe radius and the extremal polynomial (extremizer) have been found. The general case remains open,…

We consider the problem of maximizing the sum of squares of the leading coefficients of polynomials $P_{i_1}(x),\ldots ,P_{i_m}(x)$ (where $P_j(x)$ is a polynomial of degree $j$) under the restriction that the sup-norm of $\sum_{j=1}^m…

In the class of normalized sine-polynomials $S(t),$ non-negative on $[0,\pi],$ W.Rogosinski and G.Szeg\H{o} 1950 considered a number of extremal problems and proved, among other things, sharp upper and lower estimates for the coefficient…

We investigate the weighted Bojanov-Chebyshev extremal problem for trigonometric polynomials, that is, the minimax problem of minimizing $\|T\|_{w,C({\mathbb T})}$, where $w$ is a sufficiently nonvanishing, upper bounded, nonnegative weight…

The standard well-known Remez inequality gives an upper estimate of the values of polynomials on $[-1,1]$ if they are bounded by $1$ on a subset of $[-1,1]$ of fixed Lebesgue measure. The extremal solution is given by the rescaled Chebyshev…

We consider the problem of finding a best uniform approximation to the standard monomial on the unit ball in $\bbC^2$ by polynomials of lower degree with complex coefficients. We reduce the problem to a one-dimensional weighted minimization…

In this article, we consider the reciprocal antisymmetric polynomial \[P(z) = \sum_{j = 0}^{s}(-1)^j\gamma_j\left(z^j - z^{N + s + 1 - j}\right), \ \gamma_0 = 1.\] It is shown that if all the zeros of $P(z)$ are located on the unit circle,…

In this article the solution of the special problem of the conditional extremum for the conjugate trigonometric polynomials is given. A possibility to apply this result to the problems of optimal stabilization of quasidynamic chaos in…

The famous Koebe $\frac14$ theorem deals with univalent (i.e., injective) analytic functions $f$ on the unit disk $\mathbb D$. It states that if $f$ is normalized so that $f(0)=0$ and $f'(0)=1$, then the image $f(\mathbb D)$ contains the…

We study the problem of minimizing the supremum norm by monic polynomials with integer coefficients. Let ${\M}_n({\Z})$ denote the monic polynomials of degree $n$ with integer coefficients. A {\it monic integer Chebyshev polynomial} $M_n…

In this paper we prove a recent conjecture formulated by Dmitrishin, Smorodin and Stokolos about that certain polynomials are univalent in the unit disk. As a consequence we get an upper estimate for the Koebe radius of univalent…

Extremal problems for typically real polynomials go back to a paper by W. W. Rogosinski and G. Szeg\H{o}, where a number of problems were posed, which were partially solved by using orthogonal polynomials. Since then, not too many new…

We study the problem of minimizing the supremum norm, on a segment of the real line or on a compact set in the plane, by polynomials with integer coefficients. The extremal polynomials are naturally called integer Chebyshev polynomials.…

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…

The famous T. Suffridge polynomials have many extremal properties: the maximality of coefficients when the leading coefficient is maximal; the zeros of the derivative are located on the unit circle; the maximum radius of stretching the unit…

The century old extremal problem, solved by Carath\'eodory and Fej\'er, concerns a nonnegative trigonometric polynomial normalized by a0 = 1, and the quantity to be maximized is the coefficient a1. In the complex exponential form, 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…

This paper contains sharp bounds on the coefficients of the polynomials $R$ and $S$ which solve the classical one variable B\'{e}zout identity $A R + B S = 1$, where $A$ and $B$ are polynomials with no common zeros. The bounds are expressed…

The multivariate integer Chebyshev problem is to find polynomials with integer coefficients that minimize the supremum norm over a compact set in $\C^d.$ We study this problem on general sets, but devote special attention to product sets…