Complete Congruences of Jacobi sums of order 2l^2 with prime l
Md Helal Ahmed, Jagmohan Tanti

TL;DR
This paper derives new congruences for Jacobi sums of order 2l^2 with odd prime l, enabling algebraic and arithmetic characterizations of these sums.
Contribution
It establishes the first known congruences for Jacobi sums of order 2l^2, expanding the theoretical understanding of these sums.
Findings
Derived explicit congruences for Jacobi sums of order 2l^2
Provided algebraic characterizations based on these congruences
Extended previous results to a new class of sums
Abstract
The congruences for Jacobi sums of some lower orders has been treated by many authors in the literature. In this paper we establish the congruences for Jacobi sums of order 2l^2 with odd prime l. These congruences are useful to obtain algebraic and arithmetic characterizations for Jacobi sums of order 2l^2 .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Identities · Advanced Algebra and Geometry · Mathematical functions and polynomials
Complete Congruences of Jacobi sums of order with prime
Md Helal Ahmed and Jagmohan Tanti
Md Helal Ahmed @ Department of Mathematics, Central University of Jharkhand, Ranchi-835205, India
Jagmohan Tanti @ Department of Mathematics, Central University of Jharkhand, Ranchi-835205, India
Abstract.
The congruences for Jacobi sums of some lower orders have been treated by many authors in the literature. In this paper we establish the congruences for Jacobi sums of order with odd prime in terms of coefficients of Jacobi sums of order . These congruences are useful to obtain algebraic and arithmetic characterizations for Jacobi sums of order .
Key words and phrases:
Character; Jacobi sums; Embedding; Congruence’s; Cyclotomic field
2010 Mathematics Subject Classification:
Primary: 11T24, Secondary: 11T22
1. Introduction
Let be an integer, a rational prime, and . Let be a finite field of elements. We can write for some . Let be a generator of the cyclic group and . Define a multiplicative character by and extend it on by putting . For integers , the Jacobi sum is define by
[TABLE]
However in the literature a variation of Jacobi sums is also considered and is defined by
[TABLE]
but are related by .
The study of congruences of Jacobi sums of some small orders is available in the literature. For an odd prime Dickson [7] obtained the congruences for . Parnami, Agrawal and Rajwade [14] also calculated this separately. Iwasawa [10] in , and in Parnami, Agrawal and Rajwade [13] showed that the above congruences also hold . Further in , Acharya and Katre [1] extended the work on finding the congruences for Jacobi sums and showed that
mod,
where is an odd integer such that and ind. Also in , Katre and Rajwade [11] obtained the congruence of Jacobi sum of order , i.e.,
indmod,
where . In , Ihara [9] showed that if is an odd prime power, then
.
Evans ([8], ) used simple methods to generalize this result for all . Congruences for the Jacobi sums of order ( prime) were obtained by Shirolkar and Katre [15]. They showed that
J_{l^{2}}(1,n)\equiv\begin{cases}-1+\sum_{i=3}^{l}c_{i,n}(\zeta_{l^{2}}-1)^{i}(modgcdmodgcd(l,n)=l.\end{cases}
In this paper, we determine the congruences for Jacobi sums of order . We split the problem into two cases:
Case 1. is odd. This case splits into four subcases:
Subcase i. .
Subcase ii. n=dl,\where is an odd and .
Subcase iii. with gcd.
Subcase iv. .
Case 2. is even. In this case the Jacobi sums can be calculated using the relation (which has been shown in the next section).
Also we calculate here the congruences of Jacobi sums of order which was not covered in [15] and revised the result of congruences of Jacobi sums of order for a prime.
2. Preliminaries
Let and then is a character of order and is a primitive th root of unity. The Jacobi sums and of order and respectively are defined as in the previous section. We also have .
2.1. Properties of Jacobi sums
In this subsection we discus some properties of Jacobi sums from [5, 15].
Proposition 1. If mod then
[TABLE]
In particular,
[TABLE]
Proposition 2. J_{e}(0,j)=\begin{cases}-1\ \ \ \ \ if\ j\not\equiv 0\ (modmod\ e).\end{cases}
mod
Proposition 3. Let mod but not both and zero . Then
Proposition 4. For and a automorphism of with , we have . In particular, if denotes the inverse of then .
Proposition 5. .
Proposition 6. Let , , be integers such that mod and mod. Then
[TABLE]
Proposition 7.
Proof.
The proofs of 1 - 5 and 7 follows directly using the definition of Jacobi sums (see [5, 15, 16]). The proof of 6 is analogous to the proofs in the case (see [1]). ∎
Remark 2.1*.*
The Jacobi sums of order can be determined from the Jacobi sums of order . The Jacobi sums of order can also be obtained from , for odd (or equivalently, for even). Further the Jacobi sums of order can be evaluated if one knows the Jacobi sums , .
3. Congruences for Jacobi sums of order
The evaluation of congruences for the Jacobi sums of order , has been done by Shirolkar and Katre [15]. They exclude the case for . In this section, we settle the case and revise the congruence relations for the Jacobi sums of order which shall be used to evaluate the congruences relation for the Jacobi sums of order in the next sections.
,
For , sub-case (2) in Lemma 5.3 [15] reduces to , , .
So the number of times these cyclotomic numbers will be counted in all its two forms is
[TABLE]
So the contribution of for is same as contribution of for . Hence Theorem 5.4 [15] is precisely revised as the following theorem.
Theorem 3.1**.**
*Let be a prime and . If , then a congruence for for a finite field is given by
where for , are described by equation (5.3) and is given by Lemma 5.3 in [15].*
4. Some Lemmas
Lemma 4.1**.**
Let be a prime and . If is a nontrivial character of order on the finite field , then
[TABLE]
Proof.
As for the number of satisfying the equation is same as , we have
[TABLE]
∎
Lemma 4.2**.**
Let be a prime and , then
[TABLE]
where with a generator of .
Proof.
From Proposition 6 for , and , we have
[TABLE]
By Proposition 1, we obtain .
Now equation (4.1) becomes
[TABLE]
Again by Proposition 5 and Theorem 3.1, we have
[TABLE]
For , from Lemma 4.1, we have
[TABLE]
Employing (4.4) and (4.3) in (4.2), we get
[TABLE]
∎
Lemma 4.3**.**
Let be an odd integer such that and , then
[TABLE]
where with a generator of .
Proof.
By Proposition 6 for and , we have
[TABLE]
Applying Proposition 1 to get
[TABLE]
Applying (a automorphism of ) second term in RHS, we get
[TABLE]
Now as from [5, 15, 16], we have and so, we have
[TABLE]
This implies
[TABLE]
From Proposition 5 and applying (a automorphism of ), we get,
[TABLE]
Now from Theorem 3.1, we get
[TABLE]
Employing (4.6) and Lemma 4.2 in (4.5), we get
[TABLE]
∎
Remark 4.1*.*
For by Proposition 3, we have .
Lemma 4.4**.**
Let , be an odd positive integer, then
[TABLE]
where with a generator of .
Proof.
From Proposition 6, for , and , we have
[TABLE]
Applying Proposition 1, we get
[TABLE]
Now again from [5, 15, 16], we have and so we have
[TABLE]
This implies
[TABLE]
By Proposition 5, we get
[TABLE]
Now from Theorem 3.1, we get
[TABLE]
As is of order , is of order , so by Lemma [1], we obtain
[TABLE]
For , from Proposition 3 [1], we get
[TABLE]
Applying (a automorphism of ), we get
[TABLE]
Thus
[TABLE]
This implies
[TABLE]
Employing (4.10), (4.11) and Lemma 4.2 in (4.9), we get
[TABLE]
∎
5. Main Theorem
In this section we establish the congruences of Jacobi sums of order in terms of coefficients of Jacobi sums of order .
Theorem 5.1**.**
Let be a prime and . If and are odd integer, then a congruence for over is given by
[TABLE]
where are as described in the Theorem 3.1 and with a generator of . If is even, the congruences for Jacobi sums can be calculated using the relation . Also if in the theorem is even then and is odd. Thus the congruences for gets completely determined and hence that of all Jacobi sums of order .
Proof.
The proof of the theorem is immediate from the above-mentioned Lemma’s and remark 4.1. ∎
Remark 5.1*.*
The prime ideal decompositions and absolute values of Jacobi sums are already there in the literature, adding these congruences gives idea to determine Jacobi sums of order with less complexity. P. Van Wamelen [16] has developed an idea to establish certain algebraic conditions using which one can determine the Jacobi sums uniquely. Our congruence conditions are in terms of coefficients of Jacobi sums of order and are modulo . These congruences are appropriate and have deterministic capacity for Jacobi sums of order .
Remark 5.2*.*
Establishing congruences for Jacobi sums is the significant advancement in a more straightforward solution of the Jacobi sums problem and thus for the cyclotomic problem. L. E. Dickson laid the foundation stone of cyclotomic numbers and he demonstrated how the Jacobi sums play a significant role in this theory. In [4], we have given the formula for cyclotomic numbers of order in terms of the coefficients of Jacobi sums of order . Therefore, these congruences are useful in calculations of these Jacobi sums.
Remark 5.3*.*
The Jacobi sums and cyclotomic numbers have incredible applications in various field, such as coding theory, cryptosystems, primality testing, difference sets, and so forth [3, 6, 12, 17]. Thus congruences give us an analogous result to evaluate Jacobi sums, so cyclotomic numbers.
Remark 5.4*.*
It remains an open problem to develop a methodology to determine Jacobi sums using Stickelberger’s theorem [2] along with these determined congruences.
Acknowledgments
The authors would like to thank Central University of Jharkhand, Ranchi, Jharkhand, India for the support during preparation of this research article.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Acharya, V.V., Katre, S.A.: Cyclotomic numbers of orders 2 l , l 2 𝑙 𝑙 2l,l an odd prime. Acta Arith. 69(1) , 51-74 (1995)
- 2[2] Adhikari, S.D., Katre, S.A., Thakur, D.: Cyclotomic fields and related topics. Proceedings of the summer school, Bhaskaracharya Pratishthana, Pune (1999)
- 3[3] Adleman, L., Pomerance, C., Rumely, R.: On distinguishing prime numbers from composite numbers. Ann. of Math. 117 , 173-206 (1983)
- 4[4] Ahmed, M.H., Tanti, J., Hoque, A.: Complete solution to cyclotomy of order 2 l 2 2 superscript 𝑙 2 2l^{2} with prime l 𝑙 l . Ramanujan J. DOI: 10.1007/s 11139-019-00182-9 (2019)
- 5[5] Berndt, B.C., Evans, R.J., Williams, K.S.: Gauss and Jacobi Sums. Wiley, A Wiley-Interscience Publication, New York (1998)
- 6[6] Buhler, J., Koblitz, N.: Lattice basis reduction, Jacobi sums and hyperelliptic cryptosystems, Bull. Austral. Math. Soc. 58(1) , 147-154 (1998)
- 7[7] Dickson, L.E.: Cyclotomy and trinomial congruences. Trans. Amer. Soc. 37 , 363-380 (1935)
- 8[8] Evans, R.J.: Congruences for Jacobi Sums. J. Number Theory. 71 , 109-120 (1998)
