Related papers: Need Polynomial Systems be Doubly-exponential?
In this paper we derive aggregate separation bounds, named after Davenport-Mahler-Mignotte (\dmm), on the isolated roots of polynomial systems, specifically on the minimum distance between any two such roots. The bounds exploit the…
We present a framework to decompose real multivariate polynomials while preserving invariance and positivity. This framework has been recently introduced for tensor decompositions, in particular for quantum many-body systems. Here we…
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…
We deal with the algebraicity of an iterated Puiseux series in several variables in terms of the properties of its coefficients. Our aim is to generalize to several variables the results from [HM15]. We show that the algebraicity of such a…
The classical Kepler-Coulomb system in 3 dimensions is well known to be 2nd order superintegrable, with a symmetry algebra that closes polynomially under Poisson brackets. This polynomial closure is typical for 2nd order superintegrable…
This article is a survey of the exponential polynomials (also called single-variable Bell polynomials) from the point of view of Analysis. Some new properties are included and several Analysis-related applications are mentioned.
We show that the symmetry operators for the quantum superintegrable system on the 3-sphere with generic 4-parameter potential form a closed quadratic algebra with 6 linearly independent generators that closes at order 6 (as differential…
Given a polynomial P in several variables over an algebraically closed field, we show that except in some special cases that we fully describe, if one coefficient is allowed to vary, then the polynomial is irreducible for all but at most…
We present an accurate investigation of the algebraic conditions that the symbols of a convergent, univariate, binary, non-stationary subdivision scheme should fulfill in order to reproduce spaces of exponential polynomials. A subdivision…
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 consider the unconstrained optimization of multivariate trigonometric polynomials by the sum-of-squares hierarchy of lower bounds. We first show a convergence rate of $O(1/s^2)$ for the relaxation with degree $s$ without any assumption…
Two dimensional condensed matter is realised in increasingly diverse forms that are accessible to experiment and of potential technological value. The properties of these systems are influenced by many length scales and reflect both generic…
We describe a rigorous computer algorithm for attempting to construct an explicit, discretized metric for which a complex polynomial map is expansive on a given neighborhood of its Julia set. We show construction of such a metric proves the…
These are the notes of my lectures at the 1996 European Congress of Mathematicians. {} Polynomials appear in mathematics frequently, and we all know from experience that low degree polynomials are easier to deal with than high degree ones.…
We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…
The paper deals with a complex polynomial $H$ in two variables having - a generic highest homogeneous part (without multiple zero lines), - nonconstant lower terms. In particular, under these conditions the polynomial $H$ has at least two…
In this article, we propose a few sufficient conditions on polynomials having integer coefficients all of whose zeros lie outside a closed disc centered at the origin in the complex plane and deduce the irreducibility over the ring of…
We study the problem of placing effective upper bounds for the number of zeros of solutions of Fuchsian systems on the Riemann sphere. The principal result is an explicit (non-uniform) upper bound, polynomially growing on the frontier of…
In this paper, we develop a new deflation technique for refining or verifying the isolated singular zeros of polynomial systems. Starting from a polynomial system with an isolated singular zero, by computing the derivatives of the input…
The complexity of computing the solutions of a system of multivariate polynomial equations by means of Groebner bases computations is upper bounded by a function of the solving degree. In this paper, we discuss how to rigorously estimate…