Related papers: Polynomials with Multiple Zeros and Solvable Dynam…
We show that, for a system of univariate polynomials given in sparse encoding, we can compute a single polynomial defining the same zero set, in time quasi-linear in the logarithm of the degree. In particular, it is possible to determine…
This note considers the maximal positively invariant set for polynomial discrete time dynamics subject to constraints specified by a basic semialgebraic set. The note utilizes a relatively direct, but apparently overlooked, fact stating…
The relationship between a polynomial's zeros and factors is well known. If a is a zero of f(x) then (x-a) is a factor of f(x). In this paper, we generalize this idea to polynomials of two variables and with real coefficients. We consider…
Zeros of many ensembles of polynomials with random coefficients are asymptotically equidistributed near the unit circumference. We give quantitative estimates for such equidistribution in terms of the expected discrepancy and expected…
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…
Consider a monic polynomial of degree $n$ whose subleading coefficients are independent, identically distributed, nondegenerate random variables having zero mean, unit variance, and finite moments of all orders, and let $m \geq 0$ be a…
This paper introduces the notion of probabilistic zero bounds for random polynomials. It presents new results regarding the probabilistic bounds of random polynomials whose coefficients are independently and identically distributed as…
Invariant sets are a key ingredient for verifying safety and other properties of cyber-physical systems that mix discrete and continuous dynamics. We adapt the elimination-theoretic Rosenfeld-Gr\"{o}bner algorithm to systematically obtain…
Discrete models have a long tradition in engineering, including finite state machines, Boolean networks, Petri nets, and agent-based models. Of particular importance is the question of how the model structure constrains its dynamics. This…
This paper is devoted to constructing and studying exactly solvable dynamical systems in discrete time obtained from some algebraic operations on matrices, to reductions of such systems leading to classical field theory models in…
We give bounds for the number and the size of the primes $p$ such that a reduction modulo $p$ of a system of multivariate polynomials over the integers with a finite number $T$ of complex zeros, does not have exactly $T$ zeros over the…
First a formula for the number of zeros of the orthogonal polynomial in the intervals is presented. Then a criteria about the appearance of a zero in a gap is given. Finally a necessary and sufficient condition is derived such that the…
This is a complete study of the dynamics of polynomial planar vector fields whose linear part is a multiple of the identity and whose nonlinear part is a contracting homogeneous polynomial. The contracting nonlinearity provides the…
Consider a polynomial of large degree n whose coefficients are independent, identically distributed, nondegenerate random variables having zero mean and finite moments of all orders. We show that such a polynomial has exactly k real zeros…
Stochastic dynamical systems often contain nonlinearities which make it hard to compute probability density functions or statistical moments of these systems. For the moment computations, nonlinearities in the dynamics lead to unclosed…
As an attempt to bridge between numerical analysis and algebraic geometry, this paper formulates the multiplicity for the general nonlinear system at an isolated zero, presents an algorithm for computing the multiplicity structure, proposes…
Two novel classes of many-body models with nonlinear interactions "of goldfish type" are introduced. They are solvable provided the initial data satisfy a single constraint (in one case; in the other, two constraints): i. e., for such…
Starting from the notion of discriminantly separable polynomials of degree two in each of three variables, we construct a class of integrable dynamical systems. These systems can be integrated explicitly in genus two theta-functions in a…
To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…
A fast and weakly stable method for computing the zeros of a particular class of hypergeometric polynomials is presented. The studied hypergeometric polynomials satisfy a higher order differential equation and generalize Laguerre…