On complete rational arithmetic sums of polynomial values

DOI10.1134/S008154381708003XMaRDI QIDQ1661306zbMATH OpenOpenAlexFDO

Authors V. N. Chubarikov

Publication date 16 August 2018

Published in Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s008154381708003x

zbMATH Keywords

arithmetic sums exponential sums primitive character sums of Dirichlet characters

Mathematics Subject Classification ID

Trigonometric and exponential sums (general theory) (11L03) Estimates on character sums (11L40)

Review text

Let \(n,k\in \mathbb N\), \(p\) is odd prime, \(p>n\), and consider a polynomial with integer coefficients \(f(x)=a_n x^n+ \ldots +a_1 x\) in the case \(\gcd (a_n,\ldots,a_1,p)=1\). Sums of the form \[ S(p^k) =\sum_{x=1}^q e^{2\pi if(x)/q}, \] where \(q=p^k\), are called complete rational exponential sums. A. Weil proved that \(S(p)\leq (n-1) \sqrt{p}\). The present paper studies \(S(p^k)\) and obtains a similar result in the case \(k>1\) and the congruence \(f'(x)\equiv 0 \pmod p\), \(0 \leq x < p\) has no multiple roots.

Recommendations

Cites work

Cited in

(11)

This page was built for publication: On complete rational arithmetic sums of polynomial values

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