Related papers: A $p$-adic Descartes solver: the Strassman solver
We study two important operations on polynomials defined over complete discrete valuation fields: Euclidean division and factorization. In particular, we design a simple and efficient algorithm for computing slope factorizations, based on…
By defining multiplicities for zeros of polynomials over hyperfields, Baker and Lorscheid were able to provide a unifying perspective on Descartes's rule and the Newton polygon rule for polynomials over a formally-real and valued field…
We consider the problem of computing exact sums of squares (SOS) decompositions for certain classes of non-negative multivariate polynomials, relying on semidefinite programming (SDP) solvers. We provide a hybrid numeric-symbolic algorithm…
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algebraic numbers. One motivation is to explain the method's good…
Let $p$ be an odd prime and $d = p^{\tau}(p-1)$. In the spirit of Aritn's conjecture, consider the system of two diagonal forms of degree $d$ in $s$ variables given by \begin{equation*}\begin{split} a_1x_1^d + \cdots + a_sx_s^d = 0\\…
Symmetries occur naturally in CSP or SAT problems and are not very difficult to discover, but using them to prune the search space tends to be very challenging. Indeed, this usually requires finding specific elements in a group of…
We investigate Newton's method as a root finder for complex polynomials of arbitrary degree. While polynomial root finding continues to be one of the fundamental tasks of computing, with essential use in all areas of theoretical…
We study the boundary of the cone of real polynomials that can be decomposed as a sum of squares (SOS) of real polynomials. This cone is included in the cone of nonnegative polynomials and both cones share a part of their boundary, which…
In this article, we are interested in developing polynomial decomposition techniques based on sums-of-squares (SOS), namely the difference-of-sums-of-squares (D-SOS) and the difference-of-convex-sums-of-squares (DC-SOS). In particular, the…
We are interested in finding a nonlinear polynomial $P$ on $\mathbb{R}^n$ that solves the minimal surface equation. Even though no explicit solution is found in this article, we investigate constraints that a polynomial solution must obey.…
An effective $p$-adic encoding of dendrograms is presented through an explicit embedding into the Bruhat-Tits tree for a $p$-adic number field. This field depends on the number of children of a vertex and is a finite extension of the field…
The Skolem Problem asks to determine whether a given linear recurrence sequence (LRS) has a zero term. Showing decidability of this problem is equivalent to giving an effective proof of the Skolem-Mahler-Lech Theorem, which asserts that a…
In Ehrhart theory, the well-known sign pattern problem asks: given a positive integer $d\geq 3$ and integers $1 \leq i_1 < \cdots < i_k \leq d-2$, does there exist a $d$-dimensional integral polytope $\mathcal{P}$ such that in its Ehrhart…
The Wronskian associates to d linearly independent polynomials of degree at most n, a non-zero polynomial of degree at most d(n-d). This can be viewed as giving a flat, finite morphism from the Grassmannian Gr(d,n) to projective space of…
We exhibit a probabilistic algorithm which solves a polynomial system over the rationals defined by a reduced regular sequence. Its bit complexity is roughly quadratic in the B\'ezout number of the system and linear in its bit size. Our…
We give new algorithms based on the sum-of-squares method for tensor decomposition. Our results improve the best known running times from quasi-polynomial to polynomial for several problems, including decomposing random overcomplete…
A real univariate polynomial is hyperbolic if all its roots are real. By Descartes' rule of signs a hyperbolic polynomial (HP) with all coefficients nonvanishing has exactly $c$ positive and exactly $p$ negative roots counted with…
Sturm's theorem (1829/35) provides an elegant algorithm to count and locate the real roots of any real polynomial. In his residue calculus (1831/37) Cauchy extended Sturm's method to count and locate the complex roots of any complex…
In this paper, we consider nonlocal, nonlinear partial differential equations to model anisotropic dynamics of complex root sets of random polynomials under differentiation. These equations aim to generalise the recent PDE obtained by…
This paper revisits an algorithm for isolating real roots of univariate polynomials based on continued fractions. It follows the work of Vincent, Uspen- sky, Collins and Akritas, Johnson and Krandick. We use some tricks, especially a new…