Binomial character sums modulo prime powers

From MaRDI portal
Publication:284470

DOI10.5802/JTNB.927zbMATH Open1416.11130arXiv1410.6494OpenAlexW2963166592MaRDI QIDQ284470FDOQ284470


Authors: Vincent Pigno, Chris Pinner Edit this on Wikidata


Publication date: 18 May 2016

Published in: Functiones et Approximatio. Commentarii Mathematici, Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Abstract: We show that the binomial and related multiplicative character sums sum_{stackrel{x=1}{(x,p)=1}}^{p^m} chi (x^l(Ax^k +B)^w),hspace{3ex} sum_{x=1}^{p^m} chi_1 (x)chi_2(Ax^k +B), have a simple evaluation for large enough m (for mgeq2 if pmidABk).


Full work available at URL: https://arxiv.org/abs/1410.6494




Recommendations




Cites Work


Cited In (5)





This page was built for publication: Binomial character sums modulo prime powers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q284470)