Related papers: Root separation for reducible monic polynomials of…

Let $R$ be a Dedekind ring, $\mathfrak{p}$ a nonzero prime ideal of $R$, $P\in R[X]$ a monic irreducible polynomial, and $K$ the quotient field of $R$. We give in this paper a lower bound for the $\mathfrak{p}$-adic valuation of the index…

Let $f$ be a polynomial $f$ of degree $d\ge 2$ with integer coefficients which is irreducible over the rationals. Cilleruelo conjectured that the least common multiple of the values of the polynomial at the first $N$ integers satisfies…

We show that over the field of complex numbers, \emph{every} homogeneous polynomial of degree $d$ can be approximated (in the border complexity sense) by a depth-$3$ arithmetic circuit of top fan-in at most $d+1$. This is quite surprising…

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…

We show that deciding whether a sparse univariate polynomial has a p-adic rational root can be done in NP for most inputs. We also prove a polynomial-time upper bound for trinomials with suitably generic p-adic Newton polygon. We thus…

In this paper, we give an alternative proof of separation of variables for scalar-valued polynomials $P:(\mathbb R^m)^k\to\mathbb C$ in the semistable range $m\geq 2k-1$ for the symmetry given by the orthogonal group $O(m)$. It turns out…

The multiple root loci among univariate polynomials of degree $n$ are indexed by partitions of $n$. We study these loci and their conormal varieties. The projectively dual varieties are joins of such loci where the partitions are hooks. Our…

A polynomial is expansive if all of its roots lie outside the unit circle. We define some special determinants involving the coefficients of a real polynomial and formulate necessary and sufficient conditions for expansivity using these…

Consider a random polynomial $$ G_Q(x)=\xi_{Q,n}x^n+\xi_{Q,n-1}x^{n-1}+...+\xi_{Q,0} $$ with independent coefficients uniformly distributed on $2Q+1$ integer points $\{-Q, ..., Q\}$. Denote by $D(G_Q)$ the discriminant of $G_Q$. We show…

We depart from our approximation of 2000 of all root radii of a polynomial, which has readily extended Sch{\"o}nhage's efficient algorithm of 1982 for a single root radius. We revisit this extension, advance it, based on our simple but…

Fix two integers $1\leq d<e$. We study the birational geometry of a parameter space for pairs of homogeneous polynomials of degrees $d$ and $e$ in two variables (in which the higher degree polynomial is well defined only up to a multiple of…

Rotation distance between rooted binary trees is the minimum number of simple rotations needed to transform one tree into the other. Computing the rotation distance between a pair of rooted trees can be quickly reduced in cases where there…

We explore when it is legal to differentiate a polynomial evaluated at a root of unity using modular arithmetic.

Considering the L-function of exponential sums associated to a polynomial over a finite field F_q, Deligne proved that a reciprocal root's p-adic order is a rational number in the interval [0, 1]. Based on hypergeometric theory, in this…

We study the repartition of the roots of a random p-adic polynomial in an algebraic closure of Qp.We prove that the mean number of roots generating a fixed finite extension K of Qp depends mostly on the discriminant of K, an extension…

To every integer monic polynomial of degree m can be associated m integer sequences having interesting properties to the roots of the polynomial. These sequences can be used to find the real roots of any integer monic polynomial by using…

We give a method for producing explicit bounds on $g(p)$, the least primitive root modulo $p$. Using our method we show that $g(p)<2r\,2^{r\omega(p-1)}\,p^{\frac{1}{4}+\frac{1}{4r}}$ for $p>10^{56}$ where $r\geq 2$ is an integer parameter.…

In this article, we propose a few sufficient conditions on polynomials having integer coefficients all of whose zeros lie outside a closed disc centered at the origin in the complex plane and deduce the irreducibility over the ring of…

The \emph{distance-number} of a graph $G$ is the minimum number of distinct edge-lengths over all straight-line drawings of $G$ in the plane. This definition generalises many well-known concepts in combinatorial geometry. We consider the…

We consider the set of monic real univariate polynomials of a given degree $d$ with non-vanishing coefficients, with given signs of the coefficients and with given quantities $pos$ of their positive and $neg$ of their negative roots (all…