Jacobi sums over finite fields
Let \(e > 2\) be an integer, \( \zeta_{e}\) a primitive \(e\)th root of unity, \(K={ \mathbb Q}( \zeta_{e})\), and \(p\) a prime number not dividing \(e\). Let \(r\) be an integer such that \(p^{r} \equiv 1 (\bmod\, e)\) and \(r_{0}\) the least positive integer such that \(p^{r_{0}} \equiv 1 (\bmod\, e)\). Let \({ \mathbb F}_{q}\) be the finite field with \(q=p^{r}\) elements, \( \gamma\) a generator of the cyclic group \(F_{q}^{*}\), and \( \chi: { \mathbb F}_{q}^{*} \rightarrow { \mathbb Q}( \zeta_{e})\) a multiplicative character of \({ \mathbb F}_{q}\) such that \( \chi( \gamma)= \zeta_{e}\) and \( \chi(0)=0\). For two integers \(m\) and \(n\) the Jacobi sum \(J( \chi^{m}, \chi^{n})\) is defined by NEWLINE\[NEWLINE J( \chi^{m}, \chi^{n})= \sum_{ \alpha \in { \mathbb F}_{q}} \chi^{m}(\alpha) \chi^{n}(1 - \alpha). NEWLINE\]NEWLINE The author treats two important problems in the theory of Jacobi sums. The first problem is that of giving a Diophantine system (of equations and congruences) whose unique solution determines a particular Jacobi sum. The other problem is that of giving algorithms for fast computation of Jacobi sums.NEWLINENEWLINEThe first result giving Diophantine systems for the coefficients of Jacobi sums with \(e=2^{k}\), \(m=1\), \(n=e/2\) and \(r=1\) was that of \textit{R. J. Evans} [Acta Arith. 39, 281--294 (1981; Zbl 0472.10006)]. Diophantine systems for all \(e\) equal to a prime or twice a prime and any \(m\), \(n\) and \(r\), but with \(r_{0}=1\), was later given by \textit{V. V. Acharya} and \textit{S. A. Katre} [Acta Arith. 69, 51--74 (1995; Zbl 0813.11067)]. The main result of the author generalizes these results in that it allows any \(e\), \(m\), \(n\), \(r\), \(r_{0}\) and provides existence of a unique polynomial NEWLINE\[NEWLINE H=a_{0}+a_{1}x+a_{2}x^{2}+ \cdots +a_{e-1}x^{e-1} \in { \mathbb Z}[x] NEWLINE\]NEWLINE such that NEWLINE\[NEWLINE H( \zeta_{e})=J( \chi^{m}, \chi^{n}). NEWLINE\]NEWLINE The coefficients of \(H(x)\) are uniquely determined by a system of Diophantine equations with only a finite number of solutions and by several congruence conditions ruling out all but one of the finite number of solutions.NEWLINENEWLINEIn conclusion the author gives some numerical examples on the computation of Jacobi sums and offers an algorithm which gives a possibility to compute any Jacobi sum recursively. The algorithm uses lattice reduction techniques to quickly find the value of a Jacobi sum up to a root of unity and also a result of the paper to find the correct root of unity. The algorithms compute any Jacobi sum faster than just naively summing the defined series in the case where \(q > \phi(e)^{ \phi(e)}\).
- Jacobi sums and cyclotomic numbers for a finite field
- Generalizations of Jacobsthal sums and hypergeometric series over finite fields
- Jacobians of curves over finite fields
- Jacobi-Eisenstein series over number fields
- Fermat Jacobians of Prime Degree over Finite Fields
- On the coefficients of Jacobi sums in prime cyclotomic fields
- scientific article; zbMATH DE number 7633226
- Dedekind sums for finite fields
- The Jacobi sums over Galois rings and its absolute values
- Jacobi-Trudi determinants over finite fields
- Davenport and Hasse's theorems and lifts of multiplication matrices of Gaussian periods
- Complete congruences of Jacobi sums of order \(2l^2\) with prime \(l\)
- Cyclotomic problem, Gauss sums and Legendre curve
- New Hadamard matrices of order \(4p^{2}\) obtained from Jacobi sums of order 16
- Cyclotomic numbers and primitive idempotents in the ring \(\mathrm{GF}(q)[x]/(x^{p^n} - 1)\)
- Jacobi sums and new families of irreducible polynomials of Gaussian periods
- Jacobi sum matrices
- Explicit determination of certain minimal abelian codes and their minimum distances
- A note on weight distributions of irreducible cyclic codes
- Jacobi sums and cyclotomic numbers of order l^2
- Cyclotomic numbers and Jacobi sums: a survey
- Jacobi sums and cyclotomic numbers for a finite field
- Jacobi sums and Grössencharacters
- scientific article; zbMATH DE number 954530 (Why is no real title available?)
- scientific article; zbMATH DE number 7633226 (Why is no real title available?)
- Computation of Jacobi sums of orders l^2 and 2l^2 with odd prime l
- Explicit determination of certain minimal constabelian codes
- A calculation of \(L\)-series in terms of Jacobi sums
- Explicit lifts of quintic Jacobi sums and period polynomials for \(\mathbb F_q\)
This page was built for publication: Jacobi sums over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2781446)
