Related papers: Systems of Polynomials with At Least One Positive …
We give an algorithm for deciding whether a planar polynomial differential system has a first integral which factorizes as a product of defining polynomials of curves with only one place at infinity. In the affirmative case, our algorithm…
We give sufficient conditions under which a polyanalytic polynomial of degree $n$ has (i) at least one zero, and (ii) finitely many zeros. In the latter case, we prove that the number of zeros is bounded by $n^2$. We then show that for all…
A polynomial system with $n$ equations in $n$ variables supported on a set $\mathcal{W}\subset\mathbb{R}^n$ of $n+2$ points has at most $n+1$ non-degenerate positive solutions. Moreover, if this bound is reached, then $\mathcal{W}$ is…
We show that with high probability the number of real zeroes of a random polynomial is bounded by the number of vertices on its Newton-Hadamard polygon times the cube of the logarithm of the polynomial degree. A similar estimate holds for…
We present a Hilbert space geometric approach to the problem of characterizing the positive bivariate trigonometric polynomials that can be represented as the square of a two variable polynomial possessing a certain stability requirement,…
A new numerical method is introduced for calculation of quasi-polynomial zeros with constant single delay. The trajectories of zeros are obtained depending on time-delay from zero to final time-delay value. The method determines all the…
Koiran's real $\tau$-conjecture claims that the number of real zeros of a structured polynomial given as a sum of $m$ products of $k$ real sparse polynomials, each with at most $t$ monomials, is bounded by a polynomial in $m,k,t$. This…
It is known that polynomials over quaternions may have spherical zeros and isolated left and right zeros. These zeros along with appropriately defined multiplicities form the zero structure of a polynomial. In this paper, we equivalently…
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…
The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…
Boris Shapiro and Michael Shapiro have a conjecture concerning the Schubert calculus and real enumerative geometry and which would give infinitely many families of zero-dimensional systems of real polynomials (including families of…
We evaluate the number of monic polynomials (of arbitrary degree $N$) the zeros of which equal their coefficients when these are allowed to take arbitrary complex values. In the following, we call polynomials with this property {\em…
We consider the problem of bounding away from 0 the minimum value m taken by a polynomial P of Z[X_1,...,X_k] over the standard simplex, assuming that m>0. Recent algorithmic developments in real algebraic geometry enable us to obtain a…
About two decades ago, Tsfasman and Boguslavsky conjectured a formula for the maximum number of common zeros that $r$ linearly independent homogeneous polynomials of degree $d$ in $m+1$ variables with coefficients in a finite field with $q$…
This paper investigates the location of the zeros of a sequence of polynomials generated by a rational function with a binomial-type denominator. We show that every member of a two-parameter family consisting of such generating functions…
We consider positive solutions to parametrized systems of generalized polynomial equations (with real exponents and positive parameters). By a fundamental result obtained in parallel work, polynomial systems are determined by geometric…
We consider a problem of bounding the maximal possible multiplicity of a zero at of some expansions $\sum a_i F_i(x)$, at a certain point $c,$ depending on the chosen family $\{F_i \}$. The most important example is a polynomial with $c=1.$…
We study the density of complex zeros of a system of real random SO($m+1$) polynomials in several variables. We show that the density of complex zeros of this random polynomial system with real coefficients rapidly approaches the density of…
We study some systems of polynomials whose support lies in the convex hull of a circuit, giving a sharp upper bound for their numbers of real solutions. This upper bound is non-trivial in that it is smaller than either the Kouchnirenko or…
We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…