Pith. sign in

REVIEW

Computation of Jacobi sums and cyclotomic numbers with reduced complexity

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1906.07657 v1 pith:ZZ3ZS4QU submitted 2019-06-13 math.NT

Md Helal Ahmed , Jagmohan Tanti This is my paper · ORCID
classification math.NT
keywords numberscyclotomicjacobisumsdeterminationordercomplexitycomputation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Jacobi sums and cyclotomic numbers are the important objects in number theory. The determination of all the Jacobi sums and cyclotomic numbers of order $e$ are merely intricate to compute. This paper presents the lesser numbers of Jacobi sums and cyclotomic numbers which are enough for the determination of all Jacobi sums and the cyclotomic numbers of a particular order.

Discussion (0). Continue with ORCID to comment.

Pith tools