Related papers: Ultrametric Root Counting

Viewing a bivariate polynomial f in R[x,t] as a family of univariate polynomials in t parametrized by real numbers x, we call f real rooted if this family consists of monic polynomials with only real roots. If f is the characteristic…

In this article, we investigate the statistical distribution and asymptotic behavior of the family of monic integer polynomials of degree $n$ having at least one root in a fixed number field $K$. Although the framework of thin sets implies…

We show that a monic univariate polynomial over a field of characteristic zero, with $k$ distinct non-zero known roots, is determined by its $k$ proper leading coefficients by providing an explicit algorithm for computing the multiplicities…

Let $f(x)=x^n+a_{n-1}x^{n-1}+\dots+a_0$ be an irreducible polynomial with integer coefficients. For a prime $p$ for which $f(x)$ is fully splitting modulo $ p$, we consider $n$ roots $r_i$ of $f(x)\equiv 0\bmod p$ with $0 \le r_1\le\dots\le…

We show that smooth curves of monic complex polynomials $P_a (Z)=Z^n+\sum_{j=1}^n a_j Z^{n-j}$, $a_j : I \to \mathbb C$ with $I \subset \mathbb R$ a compact interval, have absolutely continuous roots in a uniform way. More precisely, there…

Let $S$ be a rational fraction and let $f$ be a polynomial over a finite field. Consider the transform $T(f)=\operatorname{numerator}(f(S))$. In certain cases, the polynomials $f$, $T(f)$, $T(T(f))\dots$ are all irreducible. For instance,…

Let $K$ be a number field generated by a root $\th$ of a monic irreducible trinomial $F(x) = x^n+ax^{m}+b \in \Z[x]$. In this paper, we study the problem of $K$. More precisely, we provide some explicit conditions on $a$, $b$, $n$, and $m$…

A new version of the Graeffe algorithm for finding all the roots of univariate complex polynomials is proposed. It is obtained from the classical algorithm by a process analogous to renormalization of dynamical systems. This iteration is…

We present a quite efficient method to calculate the roots of Bernstein-Sato polynomial for a defining polynomial $f$ of a projective hypersurface $Z\subset{\mathbb P}^{n-1}$ of degree $d$ having only weighted homogeneous isolated…

Let $N=2n^2-1$ or $N=n^2+n-1$, for any $n\ge 2$. Let $M=\frac{N-1}{2}$. We construct families of prime knots with Jones polynomials $(-1)^M\sum_{k=-M}^{M} (-1)^kt^k$. Such polynomials have Mahler measure equal to $1$. If $N$ is prime, these…

We give a criterion for maps on ultrametric spaces to be surjective and to preserve spherical completeness. We show how Hensel's Lemma and the multi-dimensional Hensel's Lemma follow from our result. We give an easy proof that the latter…

Let $f(x)$ be an irreducible polynomial with integer coefficients of degree at least two. Hooley proved that the roots of the congruence equation $f(x)\equiv 0\mod n$ is uniformly distributed. as a parallel of Hooley's theorem under ideal…

Let $\mathcal{R} = \mathbb{K}[x_1, \dots, x_n]$ be a multivariate polynomial ring over a field $\mathbb{K}$ of characteristic 0. Consider $n$ algebraically independent elements $g_1, \dots, g_n$ in $\mathcal{R}$. Let $\mathcal{S}$ denote…

A rooted tree module (RTM) $M:=M(T,F)$ over a zero-relation algebra $\Lambda:=\mathcal KQ/\langle\rho\rangle$ over a field $\mathcal K$ is given by the data of a quiver morphism $F:T\to Q$ from a rooted tree $T$ (either with a source or a…

This paper is a step in our program for proving the Piece-Birkhoff Conjecture for regular rings of any dimension (this would contain, in particular, the classical Pierce-Birkhoff conjecture which deals with polynomial rings over a real…

Let $K=\Q(\theta)$ be an algebraic number field with $\theta$ a root of an irreducible quadrinomial $f(x) = x^6+ax^m+bx+c\in\Z[x] $ with $m\in\{2,3,4,5\}$. In the present paper, we give some explicit conditions involving only $a,~b,~c$ and…

Let k be a field of characteristic zero, let X be a geometrically integral k-variety of dimension n and let K be its field of fractions. Under the assumption that K contains all r-th roots of unity for an integer r, we prove that, given an…

Using the interplay between topological, combinatorial, and geometric properties of polynomials and analytic results (primarily the covering structure and distortion estimates), we analyze a path-lifting method for finding approximate…

This work provides a method(an algorithm) for solving the solvable unary algebraic equation $f(x)=0$ ($f(x)\in\mathbb{Q}[x]$) of arbitrary degree and obtaining the exact radical roots. This method requires that we know the Galois group as…

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…