English

Evaluating Binomial Character Sums Modulo Powers of Two

Number Theory 2014-03-13 v1

Abstract

We show that for any mod 2m2^m characters, χ1,χ2,\chi_1, \chi_2, the complete exponential sum, x=12mχ1(x)χ2(Axk+B), \sum_{x=1}^{2^m}\chi_1(x) \chi_2(Ax^k+B), has a simple explicit evaluation.

Keywords

Cite

@article{arxiv.1403.3081,
  title  = {Evaluating Binomial Character Sums Modulo Powers of Two},
  author = {Vincent Pigno and Chris Pinner and Joe Sheppard},
  journal= {arXiv preprint arXiv:1403.3081},
  year   = {2014}
}
R2 v1 2026-06-22T03:25:30.828Z