中文
相关论文

相关论文: On the Newton polygons of twisted $L$-functions of…

200 篇论文

Ailon and Rudnick have shown that if $a,b \in C[T]$ are multiplicatively independent polynomials, then $\deg(\gcd(a^n-1,b^n-1))$ is bounded for all $n\ge1$. We show that if instead $a,b \in F[T]$ for a finite field $F$ of characteristic…

数论 · 数学 2007-05-23 Joseph H. Silverman

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…

数论 · 数学 2009-12-08 Chunlei Liu , Chuanze Niu

Let $(a,a+d,a+2d)$ be an arithmetic progression of positive integers. The following statements are proved: (1) If $a\mid 2d$, then $(a, a+d, a+2d)\in\mdeg(\Tame(\mathbb{C}^3))$. (2) If $a\nmid 2d$, then, except for arithmetic progressions…

交换代数 · 数学 2011-12-30 Jiantao Li , Xiankun Du

A univariate polynomial f over a field is decomposable if f = g o h = g(h) for nonlinear polynomials g and h. It is intuitively clear that the decomposable polynomials form a small minority among all polynomials over a finite field. The…

交换代数 · 数学 2014-03-03 Konstantin Ziegler

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…

数论 · 数学 2021-02-12 Jiyou Li

The $C$-function of $T$-adic exponential sums is studeid. An explicit arithmetic bound is established for the Newton polygon of the $C$-function. This polygon lies above the Hodge polygon. It gives a sup-Hodge bound of the $C$-function of…

数论 · 数学 2010-01-05 Chunlei Liu

Let $p$ be a prime, and let $f(x)$ be an integer-valued polynomial. By a combinatorial approach, we obtain a nontrivial lower bound of the $p$-adic order of the sum $$\sum_{k=r(mod p^{\beta})}\binom{n}{k}(-1)^k f([(k-r)/p^{\alpha}]),$$…

数论 · 数学 2015-06-26 Zhi-Wei Sun

For a polynomial $f(X)=AX^d+C \in \mathbb{F}_p[X]$ with $A\neq 0$ and $d\geq 2$, we prove that if $d\;|\;p-1$ and $f^i(0)\neq f^j(0)$ for $0\leq i<j\leq N$, then $\#f^N(\mathbb{F}_p) \sim \frac{2p}{(d-1)N},$ where $f^N$ is the $N$-th…

数论 · 数学 2020-10-29 Rufei Ren

For a finite set of natural numbers $D$ consider a complex polynomial of the form $f(z) = \sum_{d \in D} c_d z^d$. Let $\rho_+(f)$ and $\rho_-(f)$ be the fractions of the unit circle that $f$ sends to the right($\operatorname{Re} f(z) > 0$)…

经典分析与常微分方程 · 数学 2024-08-22 Abdulamin Ismailov

In this paper, we study the structure of Newton polygons for compositions of polynomials over the rationals. We establish sufficient conditions under which the successive vertices of the Newton polygon of the composition $ g(f^n(x)) $ with…

数论 · 数学 2025-08-25 Anuj Jakhar , Shanta Laishram , Kotyada Srinivas , Prabhakar Yadav

A univariate polynomial f over a field is decomposable if it is the composition f = g(h) of two polynomials g and h whose degree is at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and…

交换代数 · 数学 2019-02-20 Joachim von zur Gathen

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…

交换代数 · 数学 2014-07-14 Joachim von zur Gathen , Konstantin Ziegler

We show that deciding whether a sparse univariate polynomial has a p-adic rational root can be done in NP for most inputs. We also prove a polynomial-time upper bound for trinomials with suitably generic p-adic Newton polygon. We thus…

数论 · 数学 2010-11-09 Martin Avendano , Ashraf Ibrahim , J. Maurice Rojas , Korben Rusek

We studies the Newton polygon for the L-function of toric exponential sums attached to a family of two variable generalized hyperkloosterman sum,$f_{t}(x,y)=x^{n}+y+\frac{t}{xy}$ with $t$ the parameter. The explicit Newton polygon is…

数论 · 数学 2024-11-18 Bolun Wei

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_i(P)$ denote the number of $i$-dimensional faces of a convex polytope $P$. Furthermore, let $S(n,d)$ and $C(n,d)$ denote, respectively, the stacked and the cyclic $d$-dimensional polytopes on $n$ vertices. Our main result is that for…

组合数学 · 数学 2007-05-23 Anders Björner

A tensor defined over a finite field $\mathbb{F}$ has low analytic rank if the distribution of its values differs significantly from the uniform distribution. An order $d$ tensor has partition rank 1 if it can be written as a product of two…

组合数学 · 数学 2020-05-19 Oliver Janzer

Cilleruelo conjectured that for an irreducible polynomial $f \in \mathbb{Z}[X]$ of degree $d \geq 2$ one has $$\log\left[\mathrm{lcm}(f(1),f(2),\ldots f(N))\right]\sim(d-1)N\log N$$ as $N \to \infty$. He proved it in the case $d=2$ but it…

数论 · 数学 2025-01-07 Alexei Entin , Sean Landsberg

In this paper we consider the Newton polygons of $L$-functions coming from additive exponential sums associated to a polynomial over a finite field $\F_q$. These polygons define a stratification of the space of polynomials of fixed degree.…

代数几何 · 数学 2007-05-23 Régis Blache , Eric Férard

Under mild conditions on $n,p$, we give a lower bound on the number of $n$-variable balanced symmetric polynomials over finite fields $GF(p)$, where $p$ is a prime number. The existence of nonlinear balanced symmetric polynomials is an…

组合数学 · 数学 2007-05-23 Thomas W. Cusick , Yuan Li , Pantelimon Stanica