相关论文: Chaotic Root-Finding for a Small Class of Polynomi…

Some fractional Newton methods have been proposed in order to find roots of nonlinear equations using fractional derivatives. In this paper we introduce a fractional Newton method with order $\alpha+1$ and compare with another fractional…

We revisit the classical problem of construction of a fundamental system of solutions to a linear ODE whose elements remain analytic and linearly independent for all values of the roots of the characteristic polynomial.

The dynamics of the second order rational difference equation $\displaystyle{z_{n+1}=\frac{\alpha + \beta z_{n}+ \gamma z_{n-1}}{A + B z_n + C z_{n-1}}}$ with complex parameters and arbitrary complex initial conditions is investigated. In…

We prove the holding of chaos in the sense of Li-Yorke for a family of four-dimensional discrete dynamical systems that are naturally associated to ODE systems describing coupled oscillators subject to an external non-conservative force,…

Spatio-temporally chaotic dynamics of a classical field can be described by means of an infinite hierarchy of its unstable spatio-temporally periodic solutions. The periodic orbit theory yields the global averages characterizing the chaotic…

Let $p \geq 2$ be a large prime, and let $k \ll \log p $ be a small integer. This note proves the existence of various configurations of $(k+1)$-tuples of consecutive and quasi consecutive primitive roots $n+a_0, n+a_1, n+a_2, \ldots,…

Using elementary number theory we study Diophantine equations over the rational integers of the following form, $y^2=(x+a)(x+a+k)(x+b)(x+b+k)$, $y^2=c^2x^4+ax^2+b$ and $y^2=(x^2-1)(x^2-\alpha^2)(x^2-(\alpha+1)^2).$ We express their integer…

We study the number of queries needed to identify a monotone Boolean function $f:\{0,1\}^n \rightarrow \{0,1\}$. A query consists of a 0-1-sequence, and the answer is the value of $f$ on that sequence. It is well-known that the number of…

We prove a structural result for degree-$d$ polynomials. In particular, we show that any degree-$d$ polynomial, $p$ can be approximated by another polynomial, $p_0$, which can be decomposed as some function of polynomials $q_1,...,q_m$ with…

We prove that characteristic equations of certain types of delay differential systems, under some mild conditions on their coefficients, can possess infinitely many complex roots.

We present an algorithm for isolating the roots of an arbitrary complex polynomial $p$ that also works for polynomials with multiple roots provided that the number $k$ of distinct roots is given as part of the input. It outputs $k$ pairwise…

We study the Yablonskii-Vorob'ev polynomials, which are special polynomials used to represent rational solutions of the second Painlev\'e equation. Divisibility properties of the coefficients of these polynomials, concerning powers of 4,…

Until recently, the only known method of finding the roots of polynomials over prime power rings, other than fields, was brute force. One reason for this is the lack of a division algorithm, obstructing the use of greatest common divisors.…

Many problems in applied mathematics require root finding algorithms. Unfortunately, root finding methods have limitations. Firstly, regarding the convergence, there is a trade-off between the size of it's domain and it's rate. Secondly the…

In this paper, we consider the problem of deciding the existence of real solutions to a system of polynomial equations having real coefficients, and which are invariant under the action of the symmetric group. We construct and analyze a…

This paper summarises a numerical investigation which aimed to identify and characterise regular and chaotic behaviour in time-dependent Hamiltonians H(r,p,t) = p^2/2 + U(r,t), with U=R(t)V(r) or U=V[R(t)r], where V(r) is a polynomial in x,…

We combine the known methods for univariate polynomial root-finding and for computations in the Frobenius matrix algebra with our novel techniques to advance numerical solution of a univariate polynomial equation, and in particular…

Special polynomials associated with rational solutions of the second Painlev\'{e} equation and other members of its hierarchy are discussed. New approach, which allows one to construct each polynomial is presented. The structure of the…

In the polynomial ring $T=k[y_1,...,y_n]$, with $n>1$, we bound the multiplicity of homogeneous radical ideals $I\subset (y_1^{a_1},...,y_n^{a_n})$ such that $T/I$ is a graded $k$-algebra with Krull dimension one. As a consequence we solve…

We present here a probabilistic approach to the generation of new polynomials in two discrete variables. This extends our earlier work on the 'classical' orthogonal polynomials in a previously unexplored direction, resulting in the…