On Kloosterman sums over finite fields of characteristic 3

2016/01/23 by Bassalygo, Leonid, Zinoviev, Victor
#Combinatorics (math.CO) #FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.1601.07039

Abstract

We study the divisibility by 3^k of Kloosterman sums K(a) over finite fields of characteristic 3. We give a new recurrent algorithm for finding the largest k, such that 3^k divides the Kloosterman sum K(a). This gives a new simple test for zeros of such Kloosterman sums.

Related

• On the degree of a Kloosterman sum as an algebraic integer
• The divisibility modulo 24 of Kloosterman sums on GF(2^m), m even
• Some Congruences of Kloosterman Sums and their Minimal Polynomials
• Double Sums of Kloosterman Sums in Finite Fields
• On certain values of Kloosterman sums