相关论文: Isolating Bounded and Unbounded Real Roots of a Mi…

We seek complex roots of a univariate polynomial $P$ with real or complex coefficients. We address this problem based on recent algorithms that use subdivision and have a nearly optimal complexity. They are particularly efficient when only…

The mixed volume counts the roots of generic sparse polynomial systems. Mixed cells are used to provide starting systems for homotopy algorithms that can find all those roots, and track no unnecessary path. Up to now, algorithms for that…

The polynomials with quaternion coefficients have two kind of roots: isolated and spherical. A spherical root generates a class of roots which contains only one complex number $z$ and its conjugate $\bar{z}$, and this class can be…

We present a new data structure to approximate accurately and efficiently a polynomial $f$ of degree $d$ given as a list of coefficients. Its properties allow us to improve the state-of-the-art bounds on the bit complexity for the problems…

We propose new primal-dual decomposition algorithms for solving systems of inclusions involving sums of linearly composed maximally monotone operators. The principal innovation in these algorithms is that they are block-iterative in the…

In the quadratic minimum spanning tree problem (QMSTP) one wants to find the minimizer of a quadratic function over all possible spanning trees of a graph. We present a formulation of the QMSTP as a mixed-integer semidefinite program…

Given a graph and a root, the Maximum Bounded Rooted-Tree Packing (MBRTP) problem aims at finding K rooted-trees that span the largest subset of vertices, when each vertex has a limited outdegree. This problem is motivated by peer-to-peer…

Given a sequence of real rooted polynomials $\{p_n\}_{n\geq 1}$ with a fixed asymptotic root distribution, we study the asymptotic root distribution of the repeated polar derivatives of this sequence. This limiting distribution can be seen…

We extend the algorithms of Robinson, Smyth, and McKee--Smyth to enumerate all real-rooted integer polynomials of a fixed degree, where the first few (at least three) leading coefficients are specified. Additionally, we introduce new linear…

The roots of any polynomial of degree m with integer coefficients, can be computed by manipulation of sequences made from 2m distinct symbols and counting the different symbols in the sequences. This method requires only 'primitive'…

We develop a new symbolic-numeric algorithm for the certification of singular isolated points, using their associated local ring structure and certified numerical computations. An improvement of an existing method to compute inverse systems…

Wooley ({\em J. Number Theory}, 1996) gave an elementary proof of a Bezout like theorem allowing one to count the number of isolated integer roots of a system of polynomial equations modulo some prime power. In this article, we adapt the…

The type A_n full root polytope is the convex hull in R^{n+1} of the origin and the points e_i-e_j for 1<= i<j <= n+1. Given a tree T on the vertex set [n+1], the associated root polytope P(T) is the intersection of the full root polytope…

We show that if a real trigonometric polynomial has few real roots, then the trigonometric polynomial obtained by writing the coefficients in reverse order must have many real roots. This is used to show that a class of random trigonometric…

We describe a new algorithm \texttt{Miranda} for isolating the simple zeros of a function $\boldsymbol{f}:{\mathbb R}^n\to{\mathbb R}^n$ within a box $B_0\subseteq {\mathbb R}^n$. The function $\boldsymbol{f}$ and its partial derivatives…

Linearized polynomials appear in many different contexts, such as rank metric codes, cryptography and linear sets, and the main issue regards the characterization of the number of roots from their coefficients. Results of this type have…

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 prove that any pair of bivariate trinomials has at most 5 isolated roots in the positive quadrant. The best previous upper bounds independent of the polynomial degrees counted only non-degenerate roots and even then gave much larger…

In this work, we examine the process of Tropical Polynomial Division, a geometric method which seeks to emulate the division of regular polynomials, when applied to those of the max-plus semiring. This is done via the approximation of the…

We present a combination of two algorithms that accurately calculate multiple roots of general polynomials. Algorithm I transforms the singular root-finding into a regular nonlinear least squares problem on a pejorative manifold, and…