Related papers: On zeros of exponential polynomials and quantum al…
Let $f, f_1, \ldots, f_\nV$ be polynomials with rational coefficients in the indeterminates $\bfX=X_1, \ldots, X_n$ of maximum degree $D$ and $V$ be the set of common complex solutions of $\F=(f_1,\ldots, f_\nV)$. We give an algorithm…
We compute the virtual Poincar\'e polynomials of the configuration space of $n$ ordered points on an elliptic curve with sum 0.
Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…
We present a probabilistic algorithm to compute the product of two univariate sparse polynomials over a field with a number of bit operations that is quasi-linear in the size of the input and the output. Our algorithm works for any field of…
We present a bounded probability algorithm for the computation of the Chow forms of the equidimensional components of an algebraic variety. Its complexity is polynomial in the length and in the geometric degree of the input equation system…
We propose an algorithm for finding zero divisors in quaternion algebras over quadratic number fields, or equivalently, solving homogeneous quadratic equations in three variables over $\mathbb{Q}(\sqrt{d})$ where $d$ is a square-free…
[Inserted by J. Maurice Rojas] We give a formula for the number of complex roots of a generic system of two polynomial equations in two unknowns. The formula is completely combinatorial, ultimately depending just on the convex hull of the…
Systems of differential equations with polynomial right-hand sides are very common in applications. On the other hand, their mathematical analysis is very challenging in general, due to the possibility of complex dynamics: multiple basins…
We begin by considering a sequence of polynomials in three variables whose coefficients count restricted binary overpartitions with certain properties. We then concentrate on two specific subsequences that are closely related to the…
There are several numerical methods for computing approximate zeros of a given univariate polynomial. In this paper, we develop a simple and novel method for determining sharp upper bounds on errors in approximate zeros of a given…
We study the decomposition of multivariate polynomials as sums of powers of linear forms. As one of our main results we give an algorithm for the following problem: given a homogeneous polynomial of degree 3, decide whether it can be…
Analyzing large sparse electrical networks is a fundamental task in physics, electrical engineering and computer science. We propose two classes of quantum algorithms for this task. The first class is based on solving linear systems, and…
We establish how the coefficients of a sparse polynomial system influence the sum (or the trace) of its zeros. As an application, we develop numerical tests for verifying whether a set of solutions to a sparse system is complete. These…
In this paper we sharpen significantly several known estimates on the maximal number of zeros of complex harmonic polynomials. We also study the relation between the curvature of critical lemniscates and its impact on geometry of caustics…
We use a method based on the division algorithm to determine all the values of the real parameters $b$ and $c$ for which the hypergeometric polynomials $_2F_1(-n, b; c; z)$ have $n$ real, simple zeros. Furthermore, we use the…
This paper investigates asymptotic distribution of complex zeros of random polynomials $P_n(z):=\sum_{k=0}^{n}b(k)\xi_k z^k$, as $n\to\infty$, where $b$ is a regularly varying function at infinity with index $\alpha\in \mathbb{R}$ and…
Computing the determinant of a matrix with the univariate and multivariate polynomial entries arises frequently in the scientific computing and engineering fields. In this paper, an effective algorithm is presented for computing the…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
We study quantum algorithms working on classical probability distributions. We formulate four different models for accessing a classical probability distribution on a quantum computer, which are derived from previous work on the topic, and…
Zeros of Bessel functions $J_\alpha$ play an important role in physics. They are a motivation for studying zeros of exponential polynomials defined over $\overline{\mathbb{Q}}$, and more generally of $E$-functions. In this paper we…