English
Related papers

Related papers: Generic Newton polygon for exponential sums in two…

200 papers

Let $p$ denote an odd prime. In this paper, we are concerned with the $p$-divisibility of additive exponential sums associated to one variable polynomials over a finite field of characteristic $p$, and with (the very close question of)…

Number Theory · Mathematics 2015-02-04 Régis Blache

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…

Number Theory · Mathematics 2016-02-23 Christopher Davis , Daqing Wan , Liang Xiao

A conjecture of Le says that the Deligne polytope $\Delta_d$ is generically ordinary if $p\equiv 1\ (\!\!\bmod\ D(\Delta_d))$, where $D(\Delta_d)$ is a combinatorial constant determined by $\Delta_d$. In this paper a counterexample is given…

Number Theory · Mathematics 2021-02-12 Jiyou Li

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…

Number Theory · Mathematics 2025-01-29 Rylan Gajek-Leonard , Uri Tomer

A polynomial has saturated Newton polytope (SNP) if every lattice point of the convex hull of its exponent vectors corresponds to a monomial. We compile instances of SNP in algebraic combinatorics (some with proofs, others conjecturally):…

Combinatorics · Mathematics 2019-12-03 Cara Monical , Neriman Tokcan , Alexander Yong

Considering the L-function of exponential sums associated to a polynomial over a finite field F_q, Deligne proved that a reciprocal root's p-adic order is a rational number in the interval [0, 1]. Based on hypergeometric theory, in this…

Number Theory · Mathematics 2014-12-30 Fusheng Leng , Banghe Li

To understand L-function is an important fundamental question in Number Theory, but there are few specific results on it, especially the calculation of its Newton polygon. Following Dwork's method it is hard to calculate an exact example,…

Number Theory · Mathematics 2015-03-26 Fusheng Leng , Banghe Li

For prime $p\equiv-1\bmod d$ and $q$ a power of $p$, we obtain the slopes of the $q$-adic Newton polygons of $L$-functions of $x^d+ax^{d-1}\in \mathbb{F}_q[x]$ with respect to finite characters $\chi$ when $p$ is larger than an explicit…

Number Theory · Mathematics 2015-11-03 Yi Ouyang , Shenxing Zhang

The purpose of this article is to prove a ``Newton over Hodge'' result for exponential sums 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.…

Number Theory · Mathematics 2021-03-03 Joe Kramer-Miller

Let $f(z,w)=(p(z),q(z,w))$ be a polynomial skew product such that the degrees of $p$ and $q$ are grater than or equal to $2$. Under one or two conditions, we prove that $f$ is conjugate to a monomial map on an invariant region near…

Dynamical Systems · Mathematics 2024-04-11 Kohei Ueno

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…

Number Theory · Mathematics 2009-12-08 Chunlei Liu , Chuanze Niu

While the P vs NP problem is mainly approached form the point of view of discrete mathematics, this paper proposes reformulations into the field of abstract algebra, geometry, fourier analysis and of continuous global optimization - which…

Computational Complexity · Computer Science 2022-10-25 Jarek Duda

In this paper we construct a generating polynomial over the rationals for the generic Newton polygon for the L function of exponential sums of the family of f = x^d+ a x^s parameterized by a, and prove some of its key properties. The…

Number Theory · Mathematics 2014-08-15 Hui June Zhu

Let k be a perfect field, and K be a totally ramified extension of K_0 = Frac W(k) of degree e. To a semi-stable p-adic representation of G_K (the absolute Galois group of K), one can classicaly associate two polygons : the Hodge polygon et…

Number Theory · Mathematics 2008-06-13 Xavier Caruso , David Savitt

The $T$-adic exponential sum of 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 $C$-function of the…

Number Theory · Mathematics 2009-11-04 Chunlei Liu , Wenxin Liu

The aim of this study is to provide a perspective to help understand the singular average operator over polynomial hypersurfaces. In particular, this perspective will provide brevity and the possibility of generalizing previous results…

Classical Analysis and ODEs · Mathematics 2019-08-23 Kiseok Yeon

Let $K$ be a function field over a finite field $k$ of characteristic $p$ and let $K_{\infty}/K$ be a geometric extension with Galois group $\mathbb{Z}_p$. Let $K_n$ be the corresponding subextension with Galois group…

Number Theory · Mathematics 2017-03-17 Michiel Kosters , Daqing Wan

Symmetric Grothendieck polynomials are inhomogeneous versions of Schur polynomials that arise in combinatorial $K$-theory. A polynomial has saturated Newton polytope (SNP) if every lattice point in the polytope is an exponent vector. We…

Combinatorics · Mathematics 2017-10-17 Laura Escobar , Alexander Yong

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

Number Theory · Mathematics 2021-07-13 Joe Kramer-Miller

One can associate to any bivariate polynomial P(X,Y) its Newton polygon. This is the convex hull of the points (i,j) such that the monomial X^i Y^j appears in P with a nonzero coefficient. We conjecture that when P is expressed as a sum of…

Computational Complexity · Computer Science 2014-05-14 Pascal Koiran , Natacha Portier , Sébastien Tavenas , Stéphan Thomassé