相关论文: Small slopes of Newton polygon of L-function

Let $p$ be a prime number. Every $n$-variable polynomial $f(\underline x)$ over a finite field of characteristic $p$ defines an Artin--Schreier--Witt tower of varieties whose Galois group is isomorphic to $\mathbb{Z}_p$. Our goal of this…

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…

This expository paper is based on the author's series of lectures delivered at the January 1999 Mini-course in Number Theory, held at Sogang University (Seoul). The aim is to give an elementary and self-contained introduction to the theory…

In this paper, we consider linear $q$-difference systems with coefficients that are germs of meromorphic functions, with Newton polygon that has two slopes. Then, we explain how to compute similar meromorphic gauge transformations than…

Newton's method is used to approximate roots of complex valued functions f by creating a sequence of points that converges to a root of f in the usual topology. For any field K equipped with a set of pairwise inequivalent absolute values…

We fix a monic polynomial $f(x) \in \mathbb F_q[x]$ over a finite field of characteristic $p$ of degree relatively prime to $p$. Let $a\mapsto \omega(a)$ be the Teichm\"uller lift of $\mathbb F_q$, and let $\chi:\mathbb{Z}\to \mathbb…

We generalize Newton-type methods for minimizing smooth functions to handle a sum of two convex functions: a smooth function and a nonsmooth function with a simple proximal mapping. We show that the resulting proximal Newton-type methods…

We present two algorithms that compute the Newton polytope of a polynomial defining a hypersurface H in C^n using numerical computation. The first algorithm assumes that we may only compute values of f - this may occur if f is given as a…

We give a number of theoretical and practical methods related to the computation of L-functions, both in the local case (counting points on varieties over finite fields, involving in particular a detailed study of Gauss and Jacobi sums),…

We prove that for any generic polynomial $f$ in two variables of degree $(d_1,d_2)$ over the rationals, for $p$ large enough the Newton slopes of the character power series $C_f^*(\chi_m,s)$ of $f$ at $p$ is independent of the choice of the…

We consider arbitrary algebraic families of lower order deformations of nondegenerate toric exponential sums over a finite field. We construct a relative polytope with the aid of which we define a ring of coefficients consisting of p-adic…

$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…

The twisted $T$-adic exponential sum associated to a polynomial in one variable is studied. An explicit arithmetic polygon in terms of the highest two exponents of the polynomial is proved to be a lower bound of the Newton polygon of the…

In a recent paper Z\'u\~niga-Galindo and the author begun the study of the local zeta functions for Laurent polynomials. In this work we continue this study by giving a very explicit formula for the local zeta function associated to a…

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,…

Any polynomial $f(x)\in\mathbb{Z}_q[x]$ defines a Witt vector $[f]\in W(\mathbb{F}_q[x])$. Consider the Artin-Schreier-Witt tower $y^F-y=[f]$. This is a tower of curves over $\mathbb{F}_q$, with total Galois group $\mathbb{Z}_p$. We want to…

We study two important operations on polynomials defined over complete discrete valuation fields: Euclidean division and factorization. In particular, we design a simple and efficient algorithm for computing slope factorizations, based on…

Computing the Newton step for a generic function $f: \mathbb{R}^N \rightarrow \mathbb{R}$ takes $O(N^{3})$ flops. In this paper, we explore avenues for reducing this bound, when the computational structure of $f$ is known beforehand. It is…

We review the Shimura-Taniyama method for computing the Newton polygon of an abelian variety with complex multiplication. We apply this method to cyclic covers of the projective line branched at three points. As an application, we produce…

In this paper, we completely determine the slopes and weights of the L-functions of an important class of exponential sums arising from analytic number theory. Our main tools include Adolphson-Sperber's work on toric exponential sums and…