Related papers: Polynomials with Multiple Zeros and Solvable Dynam…
In this paper we report a few examples of algebraically solvable dynamical systems characterized by 2 coupled Ordinary Differential Equations which read as follows: x_n = P(n) (x1, x2) , n = 1, 2 , with P(n) (x1, x2) specific polynomials of…
A technique is introduced which allows to generate -- starting from any solvable discrete-time dynamical system involving N time-dependent variables -- new, generally nonlinear, generations of discrete-time dynamical systems, also involving…
A time-dependent monic polynomial in the z variable with N distinct roots such that exactly one root has multiplicity m>=2 is considered. For k=1,2, the k-th derivatives of the N roots are expressed in terms of the derivatives of order j<=…
Recently new solvable systems of nonlinear evolution equations -- including ODEs, PDEs and systems with discrete time -- have been introduced. These findings are based on certain convenient formulas expressing the $k$-th time-derivative of…
We identify many new solvable subcases of the general dynamical system characterized by two autonomous first-order ordinary differential equations with purely quadratic right-hand sides; the solvable character of these dynamical systems…
Several recently discovered properties of multiple families of special polynomials (some orthogonal and some not) that satisfy certain differential, difference or q-difference equations are reviewed. A general method of construction of…
We evaluate the number of monic polynomials (of arbitrary degree $N$) the zeros of which equal their coefficients when these are allowed to take arbitrary complex values. In the following, we call polynomials with this property {\em…
The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…
An approach is proposed for bounding the number of zeros that solutions of linear differential systems with polynomial coefficients may have. A bound is obtained in a special case which improves upon currently existing.
We investigate the zeros of polynomial solutions to the differential-difference equation \[ P_{n+1}(x)=A_{n}(x)P_{n}^{\prime}(x)+B_{n}(x)P_{n}(x), n=0,1,... \] where $A_{n}$ and $B_{n}$ are polynomials of degree at most 2 and 1…
Novel classes of dynamical systems are introduced, including many-body problems characterized by nonlinear equations of motion of Newtonian type ("acceleration equals forces") which determine the motion of points in the complex plane. These…
We consider multivariable polynomials over a fixed number field, linear in some of the variables. For a system of such polynomials satisfying certain technical conditions we prove the existence of search bounds for simultaneous zeros with…
Consider the $n$th degree polynomial equation, $X^n+A_{n-1}X^{n-1}+...+A_1X+A_0=0$ over the ring of 2 by 2 complex matrices. If this equation has more than ${2n \choose 2}$ solutions, then it has infinitely many solutions. We show here that…
We study the number of real zeros of trigonometric polynomials in a period and the number of zeros of self-reciprocal algebraic polynomials on the unit circle under the assumption that their coefficients are in a fixed finite set of real…
For polynomials of degree two which have no zeros, the method of accompanying variables is developed and zeros of associated vector polynomials are determined. Our flexible method uses a wide variety of possible vector-valued vector…
The notion of generations of monic polynomials such that the coefficients of the polynomials of the next generation coincide with the zeros of the polynomials of the current generation is introduced, and its relevance to the identification…
We consider a problem of bounding the maximal possible multiplicity of a zero at of some expansions $\sum a_i F_i(x)$, at a certain point $c,$ depending on the chosen family $\{F_i \}$. The most important example is a polynomial with $c=1.$…
A new numerical method is introduced for calculation of quasi-polynomial zeros with constant single delay. The trajectories of zeros are obtained depending on time-delay from zero to final time-delay value. The method determines all the…
We give a survey concerning both very classical and recent results on the electrostatic interpretation of the zeros of some well-known families of polynomials, and the interplay between these models and the asymptotic distribution of their…
Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in every irreducible component of the zero set Z of F. Our techniques…