Some Congruences of Kloosterman Sums and their Minimal Polynomials
Faruk Gologlu, Gary McGuire, Richard Moloney

TL;DR
This paper investigates properties of Kloosterman sums over finite fields, establishing minimal polynomials and characterizations modulo 27 using advanced number theory tools like Stickelberger's theorem and the Gross-Koblitz formula.
Contribution
It provides new results on the minimal polynomial of Kloosterman sums over Q and characterizes ternary Kloosterman sums modulo 27, advancing understanding of their algebraic structure.
Findings
Determined the minimal polynomial over Q of Kloosterman sums.
Characterized ternary Kloosterman sums modulo 27.
Applied Stickelberger's theorem and Gross-Koblitz formula to these problems.
Abstract
We prove two results on Kloosterman sums over finite fields, using Stickelberger's theorem and the Gross-Koblitz formula. The first result concerns the minimal polynomial over Q of a Kloosterman sum, and the second result gives a characterisation of ternary Kloosterman sums modulo 27.
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
TopicsCoding theory and cryptography · Analytic Number Theory Research · semigroups and automata theory
