arXiv · 1908.04263
Computation of Jacobi sums of order l^2 and 2l^2 with prime l
Abstract
In this paper, we present the fast computational algorithms for the Jacobi sums of orders $l^2$ and $2l^{2}$ with odd prime $l$ by formulating them in terms of the minimum number of cyclotomic numbers of the corresponding orders. We also implement two additional algorithms to validate these formulae, which are also useful for the demonstration of the minimality of cyclotomic numbers required.
Explore related subjects
Keep this discovery
Md. Helal Ahmed, Jagmohan Tanti, Sumant Pushp. 2019-08-08. Computation of Jacobi sums of order l^2 and 2l^2 with prime l. https://arxiv.org/abs/1908.04263
Cite the original work for its findings. Save a collection to share your selection of sources.