Improvement on Davenport's iterative method and new results in additive number theory III
Improvement on Davenport's iterative method and new results in additive number theory, I
Incomplete character sums and a special class of permutations
We present a method of bounding incomplete character sums for finite abelian groups with arguments produced by a first-order recursion. This method is particularly effective if the recursion involves a special type of permutation called an -orthomorphism. Examples of -orthomorphisms are given.
Introduction to Kloostermania