On the Newton polygons of twisted -functions of binomials
Abstract.
Let be an order multiplicative character of a finite field and a binomial with . We study the twisted classical and -adic Newton polygons of . When , we give a lower bound of Newton polygons and show that they coincide if does not divide a certain integral constant depending on .
We conjecture that this condition holds if is large enough with respect to by combining all known results and the conjecture given by Zhang-Niu. As an example, we show that it holds for .
Key words and phrases:
Newton polygons; exponential sums; L-function2020 Mathematics Subject Classification:
11L071. Introduction
1.1. Background
Fix a rational prime . For a power of , denote by the finite field with elements, the unramified extension of of degree and its ring of integers. Let be a polynomial of degree with Teichmüller lifting . Let be a multiplicative character and the Teichmüller lifting. Then we can write for some .
For a non-trivial additive character of order , define the twisted -function
where is the twisted exponential sum
If , then is a polynomial of degree by Adolphson-Sperber [AS87, AS91, AS93], Li [Li99], Liu-Wei [LW07] and Liu [Liu07].
We will use the twisted -adic exponential sums developed by Liu-Wan [LW09] and Liu [Liu02, Liu09]. Define the twisted -adic -function
where is the twisted -adic exponential sum
Then where .
Denote by
the characteristic function, which is -adic entire in . Then
Since the -adic Newton polygon of does not depend on the choice of , we denote it by . Denote by the -adic Newton polygon of . As shown in [LW09] and [Liu07], lies over the infinity -twisted Hodge polygon , which has slopes
(1.1) |
If we write the -adic slopes of , then the -adic slopes of are
That’s to say, the -adic Newton polygon of is the restriction of on , and it determines .
The prime is required large enough in the following results. When is trivial, in [Zhu14] and [LLN09], they gave a lower bound of the Newton polygons. They defined a polynomial on the coefficients of , called Hasse polynomial. If the Hasse polynomial is nonzero, then the Newton polygons coincide this lower bound.
Assume that is a binomial. Since the exponential sums can be transformed to the twisted case when and are not coprime, we assume in this paper. When , we list the known cases here.
-
•
, it’s well-known that the Newton polygons coincides the Hodge polygon.
- •
-
•
, see [OZ16].
-
•
, see [ZN21].
For arbitrary , Liu-Niu [LN11] obtained the Newton polygons when . Zhang-Niu [ZN21] also give a conjectural description of the Newton polygons when .
1.2. Notations
We list the notations we will use.
-
•
indices.
-
•
a binomial with .
-
•
, where is the Teichml̈ler lifting and .
-
•
, the infinity -twisted Hodge polygon with slopes in (1.1).
-
•
the order of , then for some .
-
•
a polygon with slopes , defined in (1.2).
-
•
the least positive integer such that (equivalently, ).
-
•
such that , .
-
•
the minimal non-negative residue of modulo .
-
•
takes value if happens; if does not happen.
-
•
.
-
•
(resp. ) the set of permutations of (resp. ).
-
•
the minimum of for and the set of such that the summation reaches minimal. Set for convention.
-
•
, see Proposition 2.1. We will the subscript if there is no confusion.
-
•
the maximal size of for . We will the subscript if there is no confusion.
-
•
the unique solution of with .
-
•
the Hasse numbers defined in (1.3).
-
•
the minimal non-negative residue of modulo .
-
•
a constant defined in (3.1).
-
•
the -adic Artin-Hasse series, see (2.1).
-
•
a -adic uniformizer of given by , with a fixed -th root .
-
•
, see (2.2).
-
•
.
-
•
a Banach space, see (2.3).
-
•
a subspace of , see (2.4).
-
•
.
-
•
defined as .
-
•
the Frobenius, which acts on via the coefficients.
-
•
the Dwork’s -adic semi-linear operator.
-
•
the coefficients of , see (2.6).
-
•
with .
-
•
the matrix coefficient of on , see (2.7).
-
•
the sub-matrix of defined in (2.7).
-
•
the sub-matrix of a principal minor of .
-
•
the set of all principal minor of order , such that every has order .
-
•
the minimal where .
-
•
, see (2.9).
-
•
the falling factorial.
1.3. Main results
In this paper, we give an explicit lower bound of Newton polygons of twisted -functions of binomial . We reduce the Hasse polynomial to a certain integer (3.1). Then does not divide this constant, if and only if this lower bound coincides the Newton polygons. Finally, we show that this condition holds for .
Denote by the polygon such that
(1.2) |
Denote by . Then
This polygon lies above the Hodge polygon with same points at , and . Moreover, we have if . See Proposition 2.1.
Theorem 1.1.
Assume that . Then lies above . As a corollary, lies above .
Define
(1.3) |
Theorem 1.2.
Assume that . Then
(1.4) |
holds if and only if , if and only if .
Here is a constant defined in (3.1) and is the minimal positive residue of modulo . Thus we have the following corollary.
Corollary 1.3.
The following result extends [OZ16], as they considered the untwisted case with an additional condition .
Theorem 1.4.
Assume that . We have if .
We give the following conjecture, which generalizes the conjecture in [ZN21]. Note that may be zero since may be empty, so we require that is large with respect to , as in Corollary 1.3 and Theorem 1.4.
Conjecture 1.5.
If is large enough with respect to , then .
2. The lower bound
2.1. The property of the lower bound polygon
For any integer , we denote
We set for convention. For any integer , we denote
and
Proposition 2.1.
(1) For any , we have
(2) For any , we have
Thus and .
(3) If , we have .
Proof.
We omit the subscript in this proof for convention.
(1) It follows from
(2) We have
Note that
We may drop the and since they do not affect the size. Apple Lemma 2.2 times and we get .
Since
we have . Thus .
Note that also holds for . Hence and .
(3) Denote by . For any , write , and . Then , and
If this is , then , that’s impossible. Thus .
Any can be viewed as an element fixing . Thus
and then .
Now
lies in . Therefore,
since . ∎
Lemma 2.2.
Let and be two multi-sets of integers. Assume that and for any , or . Then
Proof.
Every permutation in can be viewed as an permutation in fixing , thus “” holds trivially. Write , and . Then and . Thus
If this is negative, then , which is impossible. Thus “” holds. ∎
2.2. The twisted -adic Dwork’s trace formula
This part is almost the same with [LN11, SS2,3]. Denote by
(2.1) |
the -adic Artin-Hasse series. Then if . Denote by
(2.2) |
Then
where runs through non-negative solutions of .
Denote by . Define
(2.3) |
and
(2.4) |
Define a map
(2.5) |
The power series defines a map on via multiplication. Let be the Frobenius, which acts on via the coefficients. Then the Dwork’s -adic semi-linear operator sends to . Hence acts on
We have a linear map
on over . Since is completely continuous in the sense of [Ser62], the following determinants are well-defined.
Theorem 2.3.
We have
Thus the -adic Newton polygon of is the lower convex closure of
where
(2.6) |
Proof.
Write with . Then . Let be a normal basis of over . The space has a basis
over . Let be the matrix of on with respect to this basis. Then
(2.7) |
where
Hence we have
with , where runs through all principal minors of order , see [LZ05]. Denote by as a minor of . If has order , but the order of some is not , then . Denote by the set of all principal minors of order , such that every has order . Then
(2.8) |
Theorem 2.4.
If , then
for any .
2.3. Estimation on
Denote by
Here the minimal element in is regarded as . For , define
(2.9) |
Then
and
(2.10) |
Lemma 2.5.
For any and integer ,
Proof.
We may assume that for each . One can easily show that
and the minimum arrives at
Thus
(2.11) |
The result then follows easily. ∎
Lemma 2.6.
Assume and for any . Then
Proof.
We may assume that and for any , or . Otherwise both sides should be zero. We may assume that for simplicity. Apply Lemma 2.2 to , we get
where runs through permutations on . Since
where runs through permutations on , the result then follows by induction on . ∎
Lemma 2.7.
For any , we write . Then for any permutation on ,
Proof.
Proof of Theorem 2.4.
This proof is similar to [ZN21, Theorem 3.2]. Denote by the set of indices of and
Then ,
and
where runs through permutations of such that . Here,
by (2.10), where
where . By (2.8), we only need to show that for any permutation of such that , there is a permutation of such that and .
Assume . Write , then and . Thus . Note that for , . We can choose a permutation of such that and on . Then
The result then follows. ∎
3. The Newton polygons
Lemma 3.1.
The Newton polygon lies over . Moreover, if the equality holds for one , then it holds for all .
Proof of Theorem 1.2.
(1) Since , both of and across points , we only need to show that on . By Lemma 3.1, we may assume that .
Assume . Recall that is the set of such that
and every . It’s equivalently to say, the equality in Lemma 2.5 holds. Recall that
Denote by the right hand side in Lemma 2.5. Then we have
where
is independent on .
Recall that in the proof of Theorem 2.4. Then modulo , we have
by (2.8), (2.9), [LLN09, Lemma 4.4] and [LN11, Lemma 3.5]. Hence we get the first assertion by replacing by .
(2) Denote by the minimal non-negative residue of modulo . Then . Write the minimal positive residue of modulo and . Denote by
Then
It’s easy to see that and . Since
we have . Note that does not depend on . Denote by
(3.1) |
Then
Note that . Thus
for . ∎
Proof of Corollary 1.3.
Since , we have . Hence for any . Note that
thus only depends on . Since
tends to zero as tends to infinity, the result then follows. ∎
Example 3.2.
Assume that and for all . Write and . Then
and . Since
we obtain that the Newton polygons coincide .
4. The case
If for some , then . Set for negative integer . Then
where the set of such that the size of is .
Lemma 4.1.
Denote by .
(1) If for any , then the matrix
(4.1) |
by third elementary column transformations.
(2) If for any , then (4.1) holds by third elementary column transformations, modulo .
Proof.
(1) Write
then and
(4.2) |
Hence by third elementary column transformations,
(2) In this case, (4.2) holds modulo . The result then follows easily. ∎
Proof of Theorem 1.4.
Since , we have . Denote by and the minimal non-negative residue of modulo . Then . If , then and . If , then .
Assume that . Denote by
and
Then
We have
and
For , we have and
for , we have and
If , then ; if , then . Hence are different and if . Note that or . When , we have , or , and for ,
When , we have
Meanwhile,
hence .
For any , we have
which means that . Hence . ∎
Acknowledgments. The author would like to thank Chuanze Niu and Daqing Wan for helpful discussions. The author is partially supported by NSFC (Grant No. 12001510), Anhui Initiative in Quantum Information Technologies (Grant No. AHY150200) and the Fundamental Research Funds for the Central Universities (Grant No. WK0010000061).
References
- [AS87] Alan Adolphson and Steven Sperber. Newton polyhedra and the degree of the -function associated to an exponential sum. Invent. Math., 88(3):555–569, 1987.
- [AS91] Alan Adolphson and Steven Sperber. On twisted exponential sums. Math. Ann., 290(4):713–726, 1991.
- [AS93] Alan Adolphson and Steven Sperber. Twisted exponential sums and Newton polyhedra. J. Reine Angew. Math., 443:151–177, 1993.
- [Li99] Wen-Ching Winnie Li. Character sums over -adic fields. J. Number Theory, 74(2):181–229, 1999.
- [Liu02] Chunlei Liu. Twisted higher moments of Kloosterman sums. Proc. Amer. Math. Soc., 130(7):1887–1892, 2002.
- [Liu07] Chunlei Liu. The -functions of twisted Witt extensions. J. Number Theory, 125(2):267–284, 2007.
- [Liu09] Chunlei Liu. -adic exponential sums under diagonal base change. arXiv: Number Theory, 2009.
- [LLN09] Chunlei Liu, Wenxin Liu, and Chuanze Niu. Generic rigidity of laurent polynomials. arXiv: Number Theory, 2009.
- [LN11] ChunLei Liu and ChuanZe Niu. Generic twisted -adic exponential sums of binomials. Sci. China Math., 54(5):865–875, 2011.
- [LW07] Chunlei Liu and Dasheng Wei. The -functions of Witt coverings. Math. Z., 255(1):95–115, 2007.
- [LW09] Chunlei Liu and Daqing Wan. -adic exponential sums over finite fields. Algebra Number Theory, 3(5):489–509, 2009.
- [LZ05] Hanfeng Li and Hui June Zhu. Zeta functions of totally ramified -covers of the projective line. Rend. Sem. Mat. Univ. Padova, 113:203–225, 2005.
- [OY16] Yi Ouyang and Jinbang Yang. Newton polygons of functions of polynomials . J. Number Theory, 160:478–491, 2016.
- [OZ16] Yi Ouyang and Shenxing Zhang. Newton polygons of -functions of polynomials with . Finite Fields Appl., 37:285–294, 2016.
- [Ser62] Jean-Pierre Serre. Endomorphismes complètement continus des espaces de Banach -adiques. Inst. Hautes Études Sci. Publ. Math., 12:69–85, 1962.
- [Yan03] Roger Yang. Newton polygons of -functions of polynomials of the form . Finite Fields Appl., 9(1):59–88, 2003.
- [Zhu14] Hui June Zhu. Generic -family of exponential sums. J. Number Theory, 143:82–101, 2014.
- [ZN21] Qingjie Zhang and Chuanze Niu. On exponential sums of with . Finite Fields Appl., 76:59–88, 2021.