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

We seek complex roots of a univariate polynomial $P$ with real or complex coefficients. We address this problem based on recent algorithms that use subdivision and have a nearly optimal complexity. They are particularly efficient when only…

Dynamical systems with quadratic or polynomial drift exhibit complex dynamics, yet compared to nonlinear systems in general form, are often easier to analyze, simulate, control, and learn. Results going back over a century have shown that…

We compute the precise leading asymptotics of the variance of the number of real roots for a large class of random polynomials, where the random coefficients have polynomial growth. Our results apply to many classical ensembles, including…

In this manuscript we provide a new polynomial pattern. This pattern allows to find a polynomial expansion of the form \[x^{2m+1} = \sum_{k=1}^{x}\sum_{r=0}^{m} \mathbf{A}_{m,r} k^r (x-k)^r,\] where $x,m\in\mathbb{N}$ and $\mathbf{A}_{m,r}$…

In this paper it is dealt with the following system of difference equations x_{n+1}=((a_{n})/(x_{n}))+((b_{n})/(y_{n})), y_{n+1}=((c_{n})/(x_{n}))+((d_{n})/(y_{n})), n in N_0, where the initial values x_0,y_0 are positive real numbers and…

In this paper, we study the root distribution of some univariate polynomials satisfying a recurrence of order two with linear polynomial coefficients. We show that the set of non-isolated limits of zeros of the polynomials is either an arc,…

In this work we solve in closed form the system of difference equations \begin{equation*} x_{n+1}=\dfrac{ay_nx_{n-1}+bx_{n-1}+c}{y_nx_{n-1}},\; y_{n+1}=\dfrac{ax_ny_{n-1}+by_{n-1}+c}{x_ny_{n-1}},\;n=0,1,..., \end{equation*} where the…

In this article, we construct explicit examples of pairs of non-isomorphic trees with the same restricted $U$-polynomial for every $k$; by this we mean that the polynomials agree on terms with degree at most $k+1$. The main tool for this…

We show that detecting real roots for honestly n-variate (n+2)-nomials (with integer exponents and coefficients) can be done in time polynomial in the sparse encoding for any fixed n. The best previous complexity bounds were exponential in…

The formal derivatives of the Yang-Baxter equation with respect to its spectral parameters, evaluated at some fixed point of these parameters, provide us with two systems of differential equations. The derivatives of the $R$ matrix…

We prove the existence of chaotic trajectories for the two body problem on a sphere. The trajectories we construct encounter near-collisions and are similar to the second species solutions of Poincar\'e of the classical 3 body problem. The…

We establish closed-form expansions for the number of colorings of a path or cycle on n vertices with colors from 1,...,x such that adjacent vertices are colored differently or with colors from y+1,...x.

This article provides a simple trigonometric method for determining how many roots of a quartic equation are real and how many are complex, without solving the equation. The approach replaces the quartic's classical discriminant -- a…

A classic result of Ritt describes polynomials invertible in radicals: they are compositions of power polynomials, Chebyshev polynomials and polynomials of degree at most 4. In this paper we prove that a polynomial invertible in radicals…

We show that subsets of $\mathbb{R}^n$ of large enough Hausdorff and Fourier dimension contain polynomial patterns of the form \begin{align*} ( x ,\, x + A_1 y ,\, \dots,\, x + A_{k-1} y ,\, x + A_k y + Q(y) e_n ), \quad x \in…

A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…

While convergence of polynomial chaos approximation for linear equations is relatively well understood, a lot less is known for non-linear equations. The paper investigates this convergence for a particular equation with quadratic…

Based on newly discovered properties of the shift map (Theorem 1), we believe that chaos should involve not only nearby points can diverge apart but also faraway points can get close to each other. Therefore, we propose to call a continuous…

It is known that the set of all nonnegative integers may be equipped with a total order that is chaotic in the sense that there is no monotone three-term arithmetic progressions. Such chaotic order must be so complicated that the resulting…

We use Gale duality for polynomial complete intersections and adapt the proof of the fewnomial bound for positive solutions to obtain the bound (e^4+3) 2^(k choose 2) n^k/4 for the number of non-zero real solutions to a system of n…