Related papers: Stretching Newton polygons using pure polynomials

There are open questions about which Newton polygons and Ekedahl-Oort types occur for Jacobians of smooth curves of genus $g$ in positive characteristic $p$. In this chapter, I survey the current state of knowledge about these questions. I…

Let p be a prime and let F_pbar be the algebraic closure of the finite field of p elements. Let f(x) be any one variable rational function over F_pbar with n poles of orders d_1, ...,d_n. Suppose p is coprime to d_i for every i. We prove…

$T$-adic exponential sums associated to a Laurent polynomial $f$ are introduced. They interpolate all classical $p^m$-power order exponential sums associated to $f$. The Hodge bound for the Newton polygon of $L$-functions of $T$-adic…

We study the p-adic valuations of roots of L-functions associated with certain families of exponential sums of Laurent polynomials in n variables over a finite field. The families we consider are reflection and Kloosterman variants of…

Let $f:\mathbb{C}^2 \to \mathbb{C}$ be a polynomial map. Let $\mathbb{C}^2 \subset X$ be a compactification of $\mathbb{C}^2$ where $X$ is a smooth rational compact surface and such that there exists a morphism of varieties $\Phi :X\to…

Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…

We consider polynomials that are orthogonal over an analytic Jordan curve L with respect to a positive analytic weight, and show that each such polynomial of sufficiently large degree can be expanded in a series of certain integral…

The functional decomposition of polynomials has been a topic of great interest and importance in pure and computer algebra and their applications. The structure of compositions of (suitably normalized) polynomials f=g(h) over finite fields…

When Newton's method, or Halley's method is used to approximate the $p${th} root of $1-z$, a sequence of rational functions is obtained. In this paper, a beautiful formula for these rational functions is proved in the square root case,…

Claude Sabbah has defined the Fourier transform $G$ of the Gauss-Manin system for a non-degenerate and convenient Laurent polynomial and has shown that there exists a polarized mixed Hodge structure on the vanishing cycle of $G$. In this…

Evaluating or finding the roots of a polynomial $f(z) = f_0 + \cdots + f_d z^d$ with floating-point number coefficients is a ubiquitous problem. By using a piecewise approximation of $f$ obtained with a careful use of the Newton polygon of…

We attempt to quantify the exact proportion of monic $p$-adic polynomials of degree $n$ which are irreducible. We find an exact answer to this when $n$ is prime and $p \neq n$, and also when $n = 4$ and $p \neq 2$. Our answers are rational…

The aim of this paper is to introduce a new Newton-type iterative method and then to show that this process converges to the unique solution of the scalar nonlinear equation f(x)=0 under weaker conditions involving only f and f' by fixed…

By viewing the regular $N$-gon as the set of $N$th roots of unity in the complex plane we transform several questions regarding polygon diagonals into when a polynomial vanishes when evaluated at roots of unity. To study these solutions we…

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

We consider a continuous family $(f_s)$, $s\in[0,1]$ of complex polynomials in two variables with isolated singularities, that are Newton non-degenerate. We suppose that the Euler characteristic of a generic fiber is constant (or…

For a system of polynomial equations, whose coefficients depend on parameters, the Newton polyhedron of its discriminant is computed in terms of the Newton polyhedra of the coefficients. This leads to an explicit formula (involving mixed…

Let $f$ be a polynomial with integer coefficients such that $f(n)$ positive for any positive integer $n$. We consider diverging sequences $\{ y_n\}$ given by $y_0 = b$ and $y_{n+1} = f^{y_n}(a)$ with positive integers $a$ and $b$. We show…

Monsky's celebrated equidissection theorem follows from his more general proof of the existence of a polynomial relation $f$ among the areas of the triangles in a dissection of the unit square. More recently, the authors studied a different…

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…