We obtain estimates of complete rational exponentials sums with sparse polynomials and rational functions f (x)=a 1 x r1 + } } } +a t x rt depending on the number of non zero coefficients t rather than on the degree.
Upper Bounds on Character Sums with Rational Function Entries
β Scribed by Todd Cochrane; Chun Lei Liu; Zhi Yong Zheng
- Publisher
- Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
- Year
- 2003
- Tongue
- English
- Weight
- 200 KB
- Volume
- 19
- Category
- Article
- ISSN
- 1439-7617
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The maximum entropy (MaxEnt) principle is a versatile tool for statistical inference of the probability density function (pdf) from its moments as a least-biased estimation among all other possible pdf's. It maximizes Shannon entropy, satisfying the moment constraints. Thus, the MaxEnt algorithm tra
We construct infinite class field towers of global function fields with asymptotically many rational places. In this way, we improve on asymptotic bounds of SERRE, PERRET, SCHOOF, and XING. The results can be interpreted equivalently as asymptotic bounds on the number of rational points of smooth al