arXiv subjects

Andrey Smorodin

Publications and source records attributed to Andrey Smorodin.

4 recordsLinked to original sources

arXiv2020

On C. Michel's hypothesis about the modulus of typically real polynomials

Extremal problems for typically real polynomials go back to a paper by W. W. Rogosinski and G. Szegő, where a number of problems were posed, which were partially solved by using orthogonal polynomials. Since then, not too many new results on extremal properties of typically real polynomials have been obtained. Fundamental work in this direction is due to M.~Brandt, who found a novel way of solving extremal problems. In particular, he solved C. Michel's problem of estimating the modulus of a typically real polynomial of odd degree. On the other hand, D. K. Dimitrov showed the effectivity of Fejér's method for solving the Rogosinski--Szegő problems. In this article, we completely solve Michel's problem by using Fejér's method.

math.CA↗

arXiv2019

On the Koebe Quarter Theorem for Polynomials

D. Dimitrov has posed the problem of finding polynomials that set the sharpness of the Koebe Quarter Theorem for polynomials and asked whether Suffridge polynomials are optimal. We disprove Dimitrov's conjecture for polynomials of degree 3, 4, 5 and 6. For polynomials of degree 1 and 2 the conjecture is obviously true. On the way we introduce a new family of polynomials that allows us to state a conjecture about the value of the Koebe radius for polynomials of a specific degree.

math.CV↗

arXiv2018

Dimitrov's question for the polynomials of degree 1,2,3,4,5,6

In 2002 Dimitar Dimitrov posted the problem of finding the optimal polynomials that provide the sharpness of Koebe Quarter Theorem for polynomials and asked whether Suffridge polynomials are optimal ones. We disproved Dimitrov's conjecture for polynomials of degree 3,4,5 and 6. For polynomials of degree 1 and 2 the conjecture is valid.

math.CV↗

arXiv2018

Estimating the Koebe radius for polynomials

For a pair of conjugate trigonometrical polynomials $C (t) = \sum_ { j = 1 } ^N { { a_j}\cos jt }, S(t) = \sum_ { j = 1 } ^N { { a_j}\sin jt }$ with real coefficients and normalization ${a_1} = 1 $ we solve the extremal problem \[ \sup_ {a_2,...,a_N} \left ({ \min_t \left\{ {\Re \left ({ F\left ({ { e^ {it} } } \right) } \right): \Im \left ({ F\left ({ { e^ {it} } } \right) } \right) = 0 } \right\} } \right) = -\frac14 \sec ^2\fracπ{N + 2}. \] We show that the solution is unique and is given by \[ a_j^ {(0)} = \frac {1} { { { U'_N}\left ({\cos \frac{π} { { N + 2 } } } \right) } } { U' _ { N - j + 1 } }\left ({\cos \frac{π} { { N + 2 } } } \right) { U_ { j - 1 } }\left ({\cos \frac{π} { { N + 2 } } } \right), \] where the $U_j(x)$ are the Chebyshev polynomials of the second kind, and the $U'_j(x)$ are their derivatives, $j = 1, \ldots, N.$ As a consequence, we obtain some theorems on covering of intervals by polynomial images of the unit disc. We formulate several conjectures on a number of extremal problems on classes of polynomials.

math.CV↗