Related papers: Ultrametric Root Counting

Suppose $A=k[X_1, X_2, \ldots, X_n]$ is a polynomial ring over a field $k$ and $I$ is an ideal in $A$. Then M. P. Murthy conjectured that $\mu(I)=\mu(I/I^2)$, where $\mu$ denotes the minimal number of generators. Recently, Fasel \cite{F}…

We generalize Sylvester single sums to multisets (sets with repeated elements), and show that these sums compute subresultants of two univariate polyomials as a function of their roots independently of their multiplicity structure. This is…

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 introduce an efficient way, called Newton algorithm, to study arbitrary ideals in C[[x,y]], using a finite succession of Newton polygons. We codify most of the data of the algorithm in a useful combinatorial object, the Newton tree. For…

This note is an elaboration of the ideas and intuitions of Grothendieck and Weil concerning the "arithmetic topology". Given 3-dimensional manifold M fibering over the circle we introduce an real quadratic number field K with discriminant…

Let $K$ be a number field and $p$ a prime number $\geq 5$. Let us denote by $\mu_p$ the group of the $p$th roots of unity. We define $p$ to be $K$-regular if $p$ does not divide the class number of the field $K(\mu_p)$. Under the assumption…

Let $\mathbb{F}_{q}$ be a finite field of characteristic $p$, and let $f \in \mathbb{F}_{q}[x]$ be a polynomial of degree $d > 0$. Denote the image set of this polynomial as $V_{f}=\{f(\alpha)\mid\alpha\in\mathbb{F}_{q}\}$ and denote the…

We obtain the asymptotic variance, as the degree goes to infinity, of the normalized number of real roots of a square Kostlan-Shub-Smale random polynomial system of any size. Our main tools are the Kac-Rice formula for the second factorial…

An irreducible polynomial $f\in\Bbb F_q[X]$ of degree $n$ is {\em normal} over $\Bbb F_q$ if and only if its roots $r, r^q,\dots,r^{q^{n-1}}$ satisfy the condition $\Delta_n(r, r^q,\dots,r^{q^{n-1}})\ne 0$, where…

This note is motivated by an old result of Kronecker on monic polynomials with integer coefficients having all their roots in the unit disc. We call such polynomials Kronecker polynomials for short. Let $k(n)$ denote the number of Kronecker…

Rings of integer-valued polynomials are known to be atomic, non-factorial rings furnishing examples for both irreducible elements for which all powers factor uniquely (\emph{absolutely irreducibles}) and irreducible elements where some…

We study the roots of a random polynomial over the field of p-adic numbers. For a random monic polynomial with coefficients in $\mathbb{Z}_p$, we obtain an asymptotic formula for the factorial moments of the number of roots of this…

The aim of this article is to obtain a formula giving, for a positive integer $n$, the number of roots of the $n^{th}$ continuant polynomial over a finite local ring. In particular, we will give counting formulae for the roots of the…

We obtain a Central Limit Theorem for the normalized number of real roots of a square Kostlan-Shub-Smale random polynomial system of any size as the degree goes to infinity. A study of the asymptotic variance of the number of roots is…

Let $\theta$ be a root of a monic polynomial $h(x) \in \Z[x]$ of degree $n \geq 2$. We say $h(x)$ is monogenic if it is irreducible over $\Q$ and $\{ 1, \theta, \theta^2, \ldots, \theta^{n-1} \}$ is a basis for the ring $\Z_K$ of integers…

For an arbitrary positive integer n, we construct infinitely many one-cusped hyperbolic 3-manifolds where each manifold's A-polynomial detects every n-th root of unity. This answers a question of Cooper, Culler, Gillet, Long, and Shalen as…

Let $A/K$ be an absolutely simple abelian surface defined over a number field $K$. We give unconditional upper bounds for the number of prime ideals $\mathfrak{p}$ of $K$ with norm up to $x$ such that $A$ has supersingular reduction at…

This article provides a simple trigonometric method for determining how many roots of a quartic equation are real and how many are complex, without solving the equation. The approach replaces the quartic's classical discriminant -- a…

Let $S=K[x_1, \ldots,x_n]$ denote the polynomial ring in $n$ variables over a field $K$ and let $I \subset S$ be a monomial ideal. For a vector $\mathfrak{c}\in\mathbb{N}^n$, we set $I_{\mathfrak{c}}$ to be the ideal generated by monomials…

We give an anecdotal discussion of the problem of searching for polynomials with all roots on the unit circle, whose coefficients are rational numbers subject to certain congruence conditions. We illustrate with an example from a…