On short Kloosterman sums modulo a prime

Using the Karatsuba method, we obtain new estimates for Kloosterman sums modulo a prime, which, under certain constraints on the number of summands, are sharper than similar estimates found earlier.

     

Codes associated with special linear groups and power moments of multi-dimensional Kloosterman sums

In this paper, we construct the binary linear codes C(SL(n, q)) associated with finite special linear groups SL(n, q), with both n,q powers of two. Then, via the Pless power moment identity and utilizing our previous result on the explicit expression of the Gauss sum for SL(n, q), we obtain a recursive formula for the power moments of multi- dimensional Kloosterman sums in terms of the frequencies of weights in C(SL(n, q)). In particular, when n = 2, this gives a recursive formula for the power moments of Kloosterman sums. We illustrate our results with some examples.     

Integers divisible by sums of powers of their prime factors

For each positive integer j, let βj(n):=_∑p|npj. Given a fixed positive integer k, we show that there are infinitely many positive integers n having at least two distinct prime factors and such that βj(n)|n for each j∈{1,2,…,k}.     

Fibonacci numbers that are not sums of two prime powers

In this paper, we construct an infinite arithmetic progression of positive integers such that if , then the th Fibonacci number is not a sum of two prime powers.

     

Sums of Kloosterman sums

Inventiones mathematicae -     

Equidistribution of Gauss sums and Kloosterman sums

Let m be a positive integer. Fix a nontrivial additive character for each finite field F_q. To state the first result of this paper, we also fix r distinct multiplicative characters ₁,...,_r for each finite field F_q with more than r elements. We shall prove that when varies over multiplicative characters of F_q other than the m-th roots of the r-tuples of angles of Gauss sums are asymptotically equidistributed on the r-dimensional torus (S¹)^r as q goes to infinity.The n-dimensional Kloosterman sum over F_q at a F_q^× is One can define the angle (q,a) of Kl_n(q,a) in a suitable way. We shall prove that when a varies over nonzero elements of F_q, the q–1 angles (q,a^m) of Kloosterman sums are asymptotically equidistributed as q goes to infinity.Mathematics Subject Classification (2000) 11L05, 14F20     

Summation formulas for general Kloosterman sums

N. V. Kuznetsov's summation formula is generalized to the case of a discrete subgroup GSL₂() and a system of multiplicators , satisfying certain not too restrictive conditions. In the arithmetic cases, when G is a congruence-subgroup in SL₂(), these conditions are satisfied. N. V. Kuznetsov's formula has been proved for the case G=SL₂()., =1.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 82, pp. 103–135, 1979.     

On zeros of Kloosterman sums

A Kloosterman zero is a non-zero element of ${{\mathbb F}_q}$ for which the Kloosterman sum on ${{\mathbb F}_q}$ attains the value 0. Kloosterman zeros can be used to construct monomial hyperbent (bent) functions in even (odd) characteristic, respectively. We give an elementary proof of the fact that for characteristic 2 and 3, no Kloosterman zero in ${{\mathbb F}_q}$ belongs to a proper subfield of ${{\mathbb F}_q}$ with one exception that occurs at q = 16. It was recently proved that no Kloosterman zero exists in a field of characteristic greater than 3. We also characterize those binary Kloosterman sums that are divisible by 16 as well as those ternary Kloosterman sums that are divisible by 9. Hence we provide necessary conditions that Kloosterman zeros must satisfy.     

Identities of incomplete Kloosterman sums

Identities between incomplete Kloosterman sums and incomplete hyper-Kloosterman sums are established.

     

Linear combinations of prime powers in sums of terms of binary recurrence sequences

Let (U _n ) _n≥0 be a nondegenerate binary recurrence sequence with positive discriminant. Let p ₁ , . . . , p _s be fixed prime numbers, b ₁ , . . . , b _s be fixed nonnegative integers, and a ₁ , . . . , a _t be positive integers. In this paper, under certain assumptions, we obtain a finiteness result for the solution of the Diophantine equation \( {\alpha}_1{U}_{n1}+\cdots +{\alpha}_t{U}_{n1}={b}_1{p}_1^{z_1}+\cdots {b}_s{p}_s^{z_s}. \) Moreover, we explicitly solve the equation F _n1 + F _n2 = 2 ^z1 + 3 ^z2 in nonnegative integers n ₁, n ₂, z ₁, z ₂ with z ₂ ≥ z ₁. The main tools used in this work are the lower bound for linear forms in logarithms and the Baker–Davenport reduction method. This work generalizes the recent papers [E. Mazumdar and S.S. Rout, Prime powers in sums of terms of binary recurrence sequences, arXiv:1610.02774] and [C. Bertók, L. Hajdu, I. Pink, and Z. Rábai, Linear combinations of prime powers in binary recurrence sequences, Int. J. Number Theory, 13(2):261–271, 2017].     

Twisted higher moments of Kloosterman sums

Let be a nontrivial Dirichlet character modulo an odd prime . Write

We shall prove

and, for complex ,

0, \end{displaymath}">

where is a constant depending only on .

     

Bounds of incomplete multiple Kloosterman sums

We obtain an estimate for incomplete multiple Kloosterman sums modulo a prime which improves the previous result of W. Luo.     

On the distribution of Kloosterman sums

For a prime , we consider Kloosterman sums

over a finite field of elements. It is well known that due to results of Deligne, Katz and Sarnak, the distribution of the sums when runs through is in accordance with the Sato-Tate conjecture. Here we show that the same holds where runs through the sums for , for any two sufficiently large sets .

We also improve a recent bound on the nonlinearity of a Boolean function associated with the sequence of signs of Kloosterman sums.

     

New estimates of short Kloosterman sums

In this paper, we obtain new, sharper, estimates of short Kloosterman sums.     

A transform property of Kloosterman sums

An expression for the number of times a certain trace function associated with a Kloosterman sum on an extension field assumes a given value in the base field is given and its properties explored. The relationship of this result to the enumeration of certain types of irreducible polynomials over fields of characteristic two or three and to the weights in the dual of a Melas code is considered. It is argued that the expressions obtained for the trace functions, while simply related to the Kloosterman sums, can be more directly useful than the exponential sums themselves in certain applications. In addition, they enjoy properties that are of independent interest.