Related papers: Additive Complexity and the Roots of Polynomials O…

We give formulas for the multiplicity of any affine isolated zero of a generic polynomial system of n equations in n unknowns with prescribed sets of monomials. First, we consider sets of supports such that the origin is an isolated root of…

For a prime number $p$, an integer $e\geq 2$ and a field $F$ containing a primitive $p^e$-th root of unity, the index of central simple $F$-algebras of exponent $p^e$ is bounded in terms of the $p$-symbol length of $F$. For a nonreal field…

Let $\mathfrak{g}$ be a symmetrizable Kac--Moody algebra. Given a root $\alpha$ and a real root $\beta$ of $\mathfrak{g}$, it is known that the $\beta$-string through $\alpha$, denoted $R_\alpha(\beta)$, is finite. Given an imaginary root…

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 construct families of explicit polynomials f with rational coefficients that are sums of squares of polynomials over the real numbers, but not over the rational numbers. Whether or not such examples exist was an open question originally…

We present six Theorems on the univariate real Polynomial, using which we develop a new algorithm for deciding the existence of atleast one real root for univariate integer Polynomials. Our algorithm outputs that no positive real root…

A univariate polynomial f over a field is decomposable if it is the composition f = g(h) of two polynomials g and h whose degree is at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and…

By building on a method introduced by Kashiwara and refined by Lichtin, we give upper bounds for the roots of certain b-functions associated to a regular function f in terms of a log resolution of singularities. As applications, we recover…

This article provides a simple trigonometric method for determining how many roots of a quintic equation are real and how many are complex, without solving the equation. The approach transforms a depressed quintic $t^5 + mt^3 + nt^2 + pt +…

We introduce higher $F$-rationality generalising $F$-rationality. We prove that a normal variety over a field of characteristic zero is $m$-rational if and only if it is $m$-$F$-rational after reduction modulo a sufficiently large prime…

Let K be an algebraically closed field of characteristic zero. Given a polynomial f(x,y) in K[x,y] with one place at infinity, we prove that either f is equivalent to a coordinate, or the family (f+c) has at most two rational elements. When…

We consider the problem of approximating all real roots of a square-free polynomial $f$. Given isolating intervals, our algorithm refines each of them to a width of $2^{-L}$ or less, that is, each of the roots is approximated to $L$ bits…

We prove a new upper bound for the number of smooth values of a polynomial with integer coefficients. This improves Timofeev's previous result unless the polynomial is a product of linear polynomials with integer coefficients. As an…

We give, using higher Bernstein polynomials defined in our paper [2], a stronger version of our previous result in [1] whose converse is proved in [2] and we give some complements to the results in [2] which help to compute these higher…

We prove that the roots of a smooth monic polynomial with complex-valued coefficients defined on a bounded Lipschitz domain $\Omega$ in $\mathbb R^m$ admit a parameterization by functions of bounded variation uniformly with respect to the…

The real type of a finite family of univariate polynomials characterizes the combined sign behavior of the polynomials over the real line. We derive an explicit formula for the number of real types subject to given degree bounds. For the…

We prove two results that shed new light on the monotone complexity of the spanning tree polynomial, a classic polynomial in algebraic complexity and beyond. First, we show that the spanning tree polynomials having $n$ variables and defined…

For any fixed field $K\!\in\!\{\mathbb{Q}_2,\mathbb{Q}_3,\mathbb{Q}_5, \ldots\}$, we prove that all polynomials $f\!\in\!\mathbb{Z}[x]$ with exactly $3$ (resp. $2$) monomial terms, degree $d$, and all coefficients having absolute value at…

Many interesting questions in arithmetic dynamics revolve, in one way or another, around the (local and/or global) reducibility behavior of iterates of a polynomial. We show that for very general families of integer polynomials $f$ (and,…

We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a novel way to compute a lower bound on the positive real…