Evaluating Binomial Character Sums Modulo Powers of Two

2014/03/12 by Pigno, Vincent, Pinner, Chris, Sheppard, Joe
#FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.1403.3081

Abstract

We show that for any mod 2^m characters, χ₁, χ₂, the complete exponential sum, ∑_x=1^2mχ₁(x) χ₂(Ax^k+B), has a simple explicit evaluation.

Related

• Binomial Character Sums Modulo Prime Powers
• Evaluating Prime Power Gauss and Jacobi Sums
• Character sums to prime power moduli evaluated at binary quadratic forms
• Mean values of character sums analogue of Kloosterman sums
• A computable formula for evaluating the mean square sum of L-functions