Related papers: Faster Real Feasibility via Circuit Discriminants
Given a way to evaluate an unknown polynomial with integer coefficients, we present new algorithms to recover its nonzero coefficients and corresponding exponents. As an application, we adapt this interpolation algorithm to the problem of…
We present a new deterministic algorithm for the sparse Fourier transform problem, in which we seek to identify k << N significant Fourier coefficients from a signal of bandwidth N. Previous deterministic algorithms exhibit quadratic…
Real-stable, Lorentzian, and log-concave polynomials are well-studied classes of polynomials, and have been powerful tools in resolving several conjectures. We show that the problems of deciding whether a polynomial of fixed degree is real…
We investigate the asymptotics of the expected number of real roots of random trigonometric polynomials $$ X_n(t)=u+\frac{1}{\sqrt{n}}\sum_{k=1}^n (A_k\cos(kt)+B_k\sin(kt)), \quad t\in [0,2\pi],\quad u\in\mathbb{R} $$ whose coefficients…
We study the Radical Identity Testing problem (RIT): Given an algebraic circuit representing a polynomial $f\in \mathbb{Z}[x_1, \ldots, x_k]$ and nonnegative integers $a_1, \ldots, a_k$ and $d_1, \ldots,$ $d_k$, written in binary, test…
We deploy numerical semidefinite programming and conversion to exact rational inequalities to certify that for a positive semidefinite input polynomial or rational function, any representation as a fraction of sums-of-squares of polynomials…
In this article, we establish necessary and sufficient conditions for a polynomial of degree $n$ to have exactly $n$ real roots. A complete study of polynomials of degree five is carried out. The results are compared with those obtained…
In this article, we investigate the statistical distribution and asymptotic behavior of the family of monic integer polynomials of degree $n$ having at least one root in a fixed number field $K$. Although the framework of thin sets implies…
Certificates to a linear algebra computation are additional data structures for each output, which can be used by a---possibly randomized---verification algorithm that proves the correctness of each output. The certificates are essentially…
We consider solutions to the equation f = h^r for polynomials f and h and integer r > 1. Given a polynomial f in the lacunary (also called sparse or super-sparse) representation, we first show how to determine if f can be written as h^r…
It has been shown by Ibragimov and Zaporozhets [In Prokhorov and Contemporary Probability Theory (2013) Springer] that the complex roots of a random polynomial $G_n(z)=\sum_{k=0}^n\xi_kz^k$ with i.i.d. coefficients $\xi_0,\ldots,\xi_n$…
Given an inhomogeneous chain embedded in a noisy image, we consider the conditions under which such an embedded chain is detectable. Many applications, such as detecting moving objects, detecting ship wakes, can be abstracted as the…
We consider the following basic problem: given an $n$-variate degree-$d$ homogeneous polynomial $f$ with real coefficients, compute a unit vector $x \in \mathbb{R}^n$ that maximizes $|f(x)|$. Besides its fundamental nature, this problem…
We study the problem of approximating the cone of positive semidefinite (PSD) matrices with a cone that can be described by smaller-sized PSD constraints. Specifically, we ask the question: "how closely can we approximate the set of…
In a sequence of seminal results in the 80's, Kaltofen showed that the complexity class VP is closed under taking factors. A natural question in this context is to understand if other natural classes of multivariate polynomials, for…
We study the number of real critical points of a cyclotomic polynomial $\Phi_{n}(x)$, that is, the real roots of $\Phi_{n}^{\prime}(x)$. As usual, one can, without losing generality, restrict $n$ to be the product of distinct odd primes,…
Factorization of polynomials is one of the foundations of symbolic computation. Its applications arise in numerous branches of mathematics and other sciences. However, the present advanced programming languages such as C++ and J++, do not…
If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…
We present an algorithm for isolating the roots of an arbitrary complex polynomial $p$ that also works for polynomials with multiple roots provided that the number $k$ of distinct roots is given as part of the input. It outputs $k$ pairwise…
The existence of string functions, which are not polynomial time computable, but whose graph is checkable in polynomial time, is a basic assumption in cryptography. We prove that in the framework of algebraic complexity, there are no such…