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

In this paper, we enumerate Newton polygons asymptotically. The number of Newton polygons is computable by a simple recurrence equation, but unexpectedly the asymptotic formula of its logarithm contains growing oscillatory terms. As the…

In this paper, we focus on a family of generalized Kloosterman sums over the torus. With a few changes to Haessig and Sperber's construction, we derive some relative $p$-adic cohomologies corresponding to the $L$-functions. We present…

The purpose of this article is to prove a "Newton over Hodge" result for finite characters on curves. Let $X$ be a smooth proper curve over a finite field $\mathbb{F}_q$ of characteristic $p\geq 3$ and let $V \subset X$ be an affine curve.…

The twisted $T$-adic exponential sum associated to a polynomial in one variable is studied. An explicit arithmetic polygon is proved to be the generic Newton polygon of the twisted $C$-function of the T-adic exponential sum. It gives the…

The L-function of a non-degenerate twisted Witt extension is proved to be a polynomial. Its Newton polygon is proved to lie above the Hodge polygon of that extension. And the Newton polygons of the Gauss-Heilbronn sums are explicitly…

We are studing Galois actions on fundamental groups. Using towers of coverings we construct measures on the products of finite copies of Z_p. Using these measures we can calculate coefficients of Galois representations. In the simplest case…

The $L$-function of exponential sums associated to the generic polynomial of degree $d$ in $n$ variables over a finite field of characteristic $p$ is studied. A polygon called the Frobenius polygon of the generic polynomial of degree $d$ in…

The Newton-Raphson (N-R) method is useful to find the roots of a polynomial of degree n. However, this method is limited since it diverges for the case in which polynomials only have complex roots if a real initial condition is taken. In…

We fix a monic polynomial $f(x) \in \mathbb F_q[x]$ over a finite field and consider the Artin-Schreier-Witt tower defined by $f(x)$; this is a tower of curves $\cdots \to C_m \to C_{m-1} \to \cdots \to C_0 =\mathbb A^1$, with total Galois…

In this article, we describe how to compute slopes of $p$-adic $\mathcal{L}$-invariants of arbitrary weight and level by means of the Greenberg-Stevens formula. Our method is based on work of Lauder and Vonk on computing the reverse…

The $p$-adic Newton polygon is a visual tool that encodes information about the roots and factorization of a polynomial relative to a prime $p$. In this article, we investigate how the Newton polygon changes under polynomial composition. If…

In this paper, we focus on computing the higher slope Hasse polynomials of L-functions of certain exponential sums associated to the following family of Laurent polynomials $f(x_1,\ldots ,x_{n+1})=\sum_{i=1}^na_i…

We study the polynomial approximation of symmetric multivariate functions and of multi-set functions. Specifically, we consider $f(x_1, \dots, x_N)$, where $x_i \in \mathbb{R}^d$, and $f$ is invariant under permutations of its $N$…

In this article we study the behavior of Newton polygons along $\mathbb{Z}_p$-towers of curves. Fix an ordinary curve $X$ over a finite field $\mathbb{F}_q$ of characteristic $p$. By a $\mathbb{Z}_p$-tower $X_\infty/X$ we mean a tower of…

The classical division algorithm for polynomials requires $O(n^2)$ operations for inputs of size $n$. Using reversal technique and Newton iteration, it can be improved to $O({M}(n))$, where ${M}$ is a multiplication time. But the method…

The bifurcation sets of polynomial functions have been studied by many mathematicians from various points of view. In particular, N\'emethi and Zaharia described them in terms of Newton polytopes. In this paper, we will show analogous…

Functionals with values in Non-Archimedean field of Laurent series applied to the definition of generalized solution (in the form of soliton and shock wave) of the Hopf equation and equations of elasticity theory. Calculation method for the…

In this paper we give a modular interpretation of the $k$-th symmetric power $L$-function of the Kloosterman family of exponential sums in characteristics 2 and 3, and in the case of $p=2$ and $k$ odd give the precise 2-adic Newton polygon.…

We use Newton's method to find all roots of several polynomials in one complex variable of degree up to and exceeding one million and show that the method, applied to appropriately chosen starting points, can be turned into an algorithm…

An algorithm for computing an analytic function of a matrix $A$ is described. The algorithm is intended for the case where $A$ has some close eigenvalues, and clusters (subsets) of close eigenvalues are separated from each other. This…