Related papers: Chaotic Root-Finding for a Small Class of Polynomi…
The leading Ruelle resonances of typical chaotic maps, the perturbed cat map and the standard map, are calculated by variation. It is found that, excluding the resonance associated with the invariant density, the next subleading resonances…
We study the real roots of the Yablonskii-Vorob'ev polynomials, which are special polynomials used to represent rational solutions of the second Painlev\'e equation. It has been conjectured that the number of real roots of the nth…
This paper investigates the cost of solving systems of sparse polynomial equations by homotopy continuation. First, a space of systems of $n$-variate polynomial equations is specified through $n$ monomial bases. The natural locus for the…
We apply a symbolic approach of the general quadratic decomposition of polynomial sequences - presented in a previous article referenced herein - to polynomial sequences fulfilling specific orthogonal conditions towards two given…
In this paper the chaos persistence in a class of discontinuous dynamical systems of fractional-order is analyzed. To that end, the Initial Value Problem is first transformed, by using the Filippov regularization [1], into a set-valued…
For each integer $n\geq 1$ we consider the unique polynomials $P, Q\in\mathbb{Q}[x]$ of smallest degree $n$ that are solutions of the equation $P(x)x^{n+1}+Q(x)(x+1)^{n+1}=1$. We derive numerous properties of these polynomials and their…
We present an algorithm which allows to solve analytically linear systems of differential equations which factorize to first order. The solution is given in terms of iterated integrals over an alphabet where its structure is implied by the…
We present a new algorithm for solving a polynomial program P based on the recent "joint + marginal" approach of the first author for, parametric optimization. The idea is to first consider the variable x1 as a parameter and solve the…
The recently discovered Parrondo's paradox claims that two losing games can result, under random or periodic alternation of their dynamics, in a winning game: "losing+losing=winning". In this paper we follow Parrondo's philosophy of…
The well-known mathematical instrument for detection common roots for pairs of polynomials and multiple roots of polynomials are resultants and discriminants. For a pair of polynomials $f$ and $g$ their resultant $R(f,g)$ is a function of…
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…
Expansive polynomials (whose roots are greater than 1 in modulus) often arise in dynamical systems and other computational problems. This paper examines the expansivity gap (the gap between 1 and the smallest modulus of the roots) of these…
We use Newton's method to find all roots of several polynomials in one complex variable of degree up to and exceeding one million and show that the method, applied to appropriately chosen starting points, can be turned into an algorithm…
Using the circle method, we obtain asymptotic formulae for the number of integer solutions to certain quadratic polynomials that are uniform in the coefficients of the polynomial.
An infinite family of Boolean polynomials which correspond to the discrete average maps, defined in [2], is constructed and their algebraic and combinatorial properties are investigated. They turn out to be balanced, and some recurrence…
For a class of quantized open chaotic systems satisfying a natural dynamical assumption, we show that the study of the resolvent, and hence of scattering and resonances, can be reduced to the study of a family of open quantum maps, that is…
A new method of root finding is formulated that uses a numerical iterative process involving three points. A given function y = f(x) whose roots are desired is fitted and approximated by a polynomial function of the form P(x)= a(x-b)^N that…
For relatively prime natural numbers $a$ and $b$, we study the two equations $ax+by = (a-1)(b-1)/2$ and $ax+by+1= (a-1)(b-1)/2$, which arise from the study of cyclotomic polynomials. Previous work showed that exactly one equation has a…
For chaotic scattering on quantum graphs, the semiclassical approximation is exact. We use this fact and employ supersymmetry, the colour-flavour transformation, and the saddle-point approximation to calculate the exact expression for the…
Some interesting (periodic!) solutions of certain systems of $4$ nonlinear Ordinary Differential Equations $dx_{n}\left( t\right) /dt=P_{2}^{\left( n\right) }\left[ x_{m}\left( t\right) \right] /\left[ x_{1}\left( t\right) +x_{2}\left(…