DDDmitriy Dmitrishin

Dmitriy Dmitrishin

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Dmitriy Dmitrishin has a total of 24 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Sharp Weak Type Estimates for a Family of Soria Bases

    by Dmitry Dmitrishin, Paul Hagelstein, Alex Stokolos


  • Open Access

    Univalent polynomials and Koebe's one-quarter theorem

    by Dmitriy Dmitrishin, Konstantin Dyakonov, Alex Stokolos

    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 disk of radius $\frac14$ about the origin, the value $\frac14$ being best possible. Now suppose $f$ is only allowed to range over the univalent polynomials of some fixed degree. What is the optimal radius in the Koebe-type theorem that arises? And for which polynomials is it attained? A plausible conjecture is stated, and the case of small degrees is settled.

  • Open Access

    On Suffridge polynomials

    by Jimmy Dillies, Dmitriy Dmitrishin, Alex Stokolos

    We consider some known and some new properties of the family of polynomials introduced by Ted Suffridge in 1969. We begin by giving a brief overview of their extremal properties in classic and more recent work. We also give a compact form for Suffridge polynomials which matches a general pattern discovered by Brandt. Our approach allows us to find the coefficients which Brandt's result was not giving explicitly. This new presentation provides us the tools to obtain an estimate of the rate of approximation of the generalized Koebe functions by univalent polynomials. Furthermore, we consider the presentation of Suffridge polynomials in Robertson's form and find the suiting Robertson measure. This suggests a new way to approximate step functions by continuous monotonic ones. We then study the lack of robustness of the univalency of these polynomials and suggest a new family of polynomials for which we conjecture the univalency of a subclass. Namely, we prove the quite surprising fact that by extending the family by letting the discrete argument in the polynomial coefficients become continuous one does not increase the set of univalent polynomials. Only the initial polynomials remain univalent. In this new one parameter family generalizing the Suffridge polynomials, it is remarkable that the Suffridge polynomials are already extremal as they correspond to the choice of the parameter set to 1; moreover the complex Fej\'er polynomials correspond the choice of the parameter set to 0, and the choice of the parameter set to -1 corresponds the polynomials $z+(z^N/N)$. Remarkably, computer simulations seem to clearly indicate that the image of the unit disc under these new polynomial mapping is a simply-connected region bounded by a simple curve. This justifies the conjectural univalency of these polynomials for the whole range of the parameters.

  • Open Access

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

    by Dmitriy Dmitrishin, Andrey Smorodin, Alex Stokolos

    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 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\'er's method for solving the Rogosinski--Szeg\H{o} problems. In this article, we completely solve Michel's problem by using Fej\'er's method.

  • Open Access

    Average predictive control for nonlinear discrete dynamical systems

    by D. Dmitrishin, E. Iacob, A. Stokolos

    We explore the problem of stabilization of unstable periodic orbits in discrete nonlinear dynamical systems. This work proposes the generalization of predictive control method for resolving the stabilization problem. Our method embodies the development of control method proposed by B.T. Polyak. The control we propose uses a linear (convex) combination of iterated functions. With the proposed method auxiliary, the problem of robust cycle stabilization for various cases of its multipliers localization is solved. An algorithm for finding a given length cycle when its multipliers are known is described as a particular case of our method application. Also, we present numerical simulation results for some well-known mappings and the possibility of further generalization of this method.

  • Open Access

    On the Koebe Quarter Theorem for Polynomials

    by Jimmy Dillies, Dmitriy Dmitrishin, Andrey Smorodin, Alex Stokolos

    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.

  • Open Access

    Estimating the Koebe radius for polynomials

    by Dmitriy Dmitrishin, Andrey Smorodin, Alex Stokolos

    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\pi{N + 2}. \] We show that the solution is unique and is given by \[ a_j^ {(0)} = \frac {1} { { { U'_N}\left ({\cos \frac{\pi } { { N + 2 } } } \right) } } { U' _ { N - j + 1 } }\left ({\cos \frac{\pi } { { N + 2 } } } \right) { U_ { j - 1 } }\left ({\cos \frac{\pi } { { 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.

  • Open Access

    Fejer Polynomials and Control of Nonlinear Discrete Systems

    by Dmitriy Dmitrishin, Paul Hagelstein, Anna Khamitova, Anatolii Korenovskyi, Alex Stokolos

    We consider optimization problems associated to a delayed feedback control (DFC) mechanism for stabilizing cycles of one dimensional discrete time systems. In particular, we consider a delayed feedback control for stabilizing $T$-cycles of a differentiable function $f: \mathbb{R}\rightarrow\mathbb{R}$ of the form $$x(k+1) = f(x(k)) + u(k)$$ where $$u(k) = (a_1 - 1)f(x(k)) + a_2 f(x(k-T)) + \cdots + a_N f(x(k-(N-1)T))\;,$$ with $a_1 + \cdots + a_N = 1$. Following an approach of Morg\"ul, we associate to each periodic orbit of $f$, $N \in \mathbb{N}$, and $a_1,\ldots,a_N$ an explicit polynomial whose Schur stability corresponds to the stability of the DFC on that orbit. We prove that, given any 1- or 2-cycle of $f$, there exist $N$ and $a_1,\ldots,a_N$ whose associated polynomial is Schur stable, and we find the minimal $N$ that guarantees this stabilization. The techniques of proof will take advantage of extremal properties of the Fej\'er kernels found in classical harmonic analysis.

  • Open Access

    Finding, Stabilizing, and Verifying Cycles of Nonlinear Dynamical Systems

    by D. Dmitrishin, I. E. Iacob, I. Skrinnik, A. Stokolos

    We present a new solution for fundamental problems in nonlinear dynamical systems: finding, verifying, and stabilizing cycles. The solution we propose consists of a new control method based on mixing previous states of the system (or the functions of these states). This approach allows us to locally stabilize and to find a priori unknown cycles of a given length. Our method generalizes and improves on the existing one dimensional space solutions to multi-dimensional space while using the geometric complex functions theory rather than a linear algebra approach. Several numerical examples are considered. All statements and formulas are given in final form. The formulas derivation and reasoning may be found in the cited references. The article focuses on practical applications of methods and algorithms.

  • Open Access

    Generalization of nonlinear control for nonlinear discrete systems

    by D. Dmitrishin, A. Stokolos, I. Skrynnik, E. Franzheva

    The problem of stabilization of unstable periodic orbits of discrete nonlinear systems is considered in the article. A new generalization of the delayed feedback, which solves the stabilization problem, is proposed. The feedback is represented as a convex combination of nonlinear feedback and semilinear feedback introduced by O. Morgul. In this article, the O. Morgul method was transferred from the scalar case to the vector one. It is shown that the additional introduction of the semilinear feedback into the equation makes it possible to significantly reduce the length of the prehistory used in the control and to increase the rate of convergence of the perturbed solutions to periodic ones. As an application of the proposed stabilization scheme, a possible computational algorithm for finding solutions of systems of algebraic equations is given. The numerical simulation results are presented.