Computation of Jacobi sums of orders \(l^2\) and \(2l^2\) with odd prime \(l\) (Q6107474)

Carl Gustav Jacob Jacobi was a brilliant mathematician and an exceptional teacher of mathematics. He is well-known for his famous quote, ``The sole end of science is the honor of the human mind, and\dots under this title, a question about numbers is worth as much as a question about the system of the world.'' This quote emphasizes the importance of his invention, the Jacobi Sum, which is a significant contribution to the field of mathematics. Let \(p \in \mathbb{Z}\) be an odd prime and \(q = p^{r}\) with \(r \geq 1\) an integer. Let \(e \geq 2\) be an integral divisor of \(q -1\), then \(q = ek + 1\) for some positive integer \(k\). Let \(\gamma\) be a generator of the cyclic group \(\mathbb{F}_{q}^{*}\) . For \(\zeta_{e}\) a primitive \(e^{th}\) root of unity, we define a multiplicative character \(\chi_{e}\) of order \(e\) on \(\mathbb{F}_{q}^{*}\) by \(\chi_{e}(\gamma ) = \zeta_{e}\). Also for \(v \in \mathbb{F}_{q}^{*}\) , \(\mathrm{ind}_{\gamma} (v)\) is defined to be a positive integer \(m \leq q - 1\) such that \(v = \gamma m\). We now extend \(\chi_{e}\) to \(\mathbb{F}_{q}\) by taking \(\chi_{e}(0) = 0\). For \(0 \leq i, j \leq e - 1\), the Jacobi sums of order \(e\) is defined by \[ Je(i, j) = \sum_{v \in \mathbb{F}_{q}} \chi_{e}^{i}(v)\chi_{e}^{j}(v+1). \] For \( 0 \leq a, b \leq e - 1\), the cyclotomic numbers \((a, b)_{e}\) of order \(e\) are defined as follows: \((a, b)e := \# \{ v \in \mathbb{F}_{q} | \chi_{e}(v)= \zeta_{e} ^{a} , \chi_{e}(v+1)= \zeta_{e} ^{b} \}\\ = \# \{ v \in \mathbb{F}_{q} \ \{0, -1\} |\mathrm{ind}_{\gamma} (v) \equiv a\pmod e, \mathrm{ind}_{\gamma} (v+1 )\equiv b\pmod e\}.\) In this article there are five algorithms to determine Jacobi sums of different orders of which three algorithms are of fast computing category and some lengthy theorems. The relatively new fast computation algorithms offer more potential for future extensions.