Related papers: The Weierstrass root finder is not generally conve…

Given a family $(q_k)_k$ of polynomials, we call an open set $U$ root-sparse if the number of zeros of $q_k$ is locally uniformly bounded on $U$. We study the interplay between the individual zeros of the polynomials $q_k$ and those of the…

The low-degree polynomial framework has been highly successful in predicting computational versus statistical gaps for high-dimensional problems in average-case analysis and machine learning. This success has led to the low-degree…

It is well known that the Newton method may not converge when the initial guess does not belong to a specific quadratic convergence region. We propose a family of new variants of the Newton method with the potential advantage of having a…

We establish a version of the Landen's transformation for Weierstrass functions and invariants that is applicable to general lattices in complex plane. Using it we present an effective method for computing Weierstrass functions, their…

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…

Let $p(x)=a_0 + a_1 x + \ldots + a_n x^n$ be a polynomial with all roots real and satisfying $x \leq -\delta$ for some $0<\delta <1$. We show that for any $0 < \epsilon <1$, the value of $p(1)$ is determined within relative error $\epsilon$…

This paper is concerned with exact real solving of well-constrained, bivariate polynomial systems. The main problem is to isolate all common real roots in rational rectangles, and to determine their intersection multiplicities. We present…

We show that for any set of n distinct points in the complex plane, there exists a polynomial p of degree at most n+1 so that the corresponding Newton map, or even the relaxed Newton map, for p has the given points as a super-attracting…

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 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'…

Let $p$ be a normalized (monic and centered) quartic polynomial with non-trivial symmetry groups. It is already known that if $p$ is unicritical, with only two distinct roots with the same multiplicity or having a root at the origin then…

This paper derives numerical bounds for and implements the splitting circle method for finding roots of a univariate polynomial in the presence of fixed precision.

New problem is studied that is to find nonlinear differential equations with special solutions expressed via the Weierstrass function. Method is discussed to construct nonlinear ordinary differential equations with exact solutions. Main…

In this paper, using Bourbaki's convention, we consider a simple Lie algebra $\mathfrak g\subset\mathfrak g\mathfrak l_m$ of type B, C or D and a parabolic subalgebra $\mathfrak p$ of $\mathfrak g$ associated with a Levi factor composed…

We consider the following generalization of binary search in sorted arrays to tree domains. In each step of the search, an algorithm is querying a vertex $q$, and as a reply, it receives an answer, which either states that $q$ is the…

The Jones problem is a question whether there is a non-trivial knot with the trivial Jones polynomial in one variable $q$. The answer to this fundamental question is still unknown despite numerous attempts to explore it. In braid…

Let p(x) be a polynomial of degree 4 with four distinct real roots r1<r2<r3<r4. Let x1<x2<x3 be the critical points of p, and define the ratios s_{k}=((x_{k}-r_{k})/(r_{k+1}-r_{k})),k=1,2,3. For notational convenience, let s1=u, s2=v, and…

We present a new algorithm for isolating the real roots of a system of multivariate polynomials, given in the monomial basis. It is inspired by existing subdivision methods in the Bernstein basis; it can be seen as generalization of the…

Given a graph $G$, and terminal vertices $s$ and $t$, the TRACKING PATHS problem asks to compute a minimum number of vertices to be marked as trackers, such that the sequence of trackers encountered in each s-t path is unique. TRACKING…

We study the location and the size of the roots of Steiner polynomials of convex bodies in the Minkowski relative geometry. Based on a problem of Teissier on the intersection numbers of Cartier divisors of compact algebraic varieties it was…