Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Science in China Ser...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Science in China Series A Mathematics
Article . 2001 . Peer-reviewed
License: Springer TDM
Data sources: Crossref
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article . 2001
Data sources: zbMATH Open
versions View all 2 versions
addClaim

Upper bounds on a two-term exponential sum*

Upper bounds on a two-term exponential sum
Authors: Cochrane, Todd; Zheng, Zhiyong;

Upper bounds on a two-term exponential sum*

Abstract

The authors derive upper bounds for mixed exponential sums of type \[ S( \chi, a x^n + bx, p^m) = \sum_{_{\substack{ x=1\\ p \nmid x}}}^{p^m} \chi(x) e_{p^m}(a x^n + bx), \] where \(p^m\) is a prime power with \(m \geq 2\), \(a,b\) are integers, \(n \geq 2\), \(\chi\) is a multiplicative character mod \(p^m\) and \(e_{p^m}(x) = \exp(2 \pi i x/p^m)\) . If \(\chi\) is primitive or \(p \nmid (a,b)\) , then they obtain \[ |S(\chi, ax^n +bx, p^m)|\leq 2 n p^{2m/3}. \] If \(\chi\) is of conductor \(p\) with \(p \nmid (a,b)\), then \[ |S(\chi, ax^n +bx, p^m)|\leq n p^{m/2}. \]

Related Organizations
Keywords

upper bounds, mixed exponential sums, Estimates on exponential sums

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    20
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 10%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
20
Top 10%
Top 10%
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!