Using Stepanov's method for exponential sums involving rational functions

By Todd Cochrane, Christopher G. Pinner. 2006

86 citations recorded by the source corpus.

Subfields: Algebra and Number Theory, Artificial Intelligence, Information Systems

View Paper: https://www.semanticscholar.org/paper/50b29ad2c99e244de2d2cc40ef06bdc1767938f9

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algebra and Number Theory

1. P. Michel
2. Gergely Harcos
3. Emmanuel Kowalski
4. Yitang Zhang
5. 'Etienne Fouvry
6. Paul D. Nelson
7. V. Blomer
8. Terence Tao

In Artificial Intelligence

1. P. Michel
2. Andrew V. Sutherland
3. 'Etienne Fouvry
4. Gergely Harcos
5. Yitang Zhang
6. Wouter Castryck
7. Emmanuel Kowalski
8. Terence Tao

In Information Systems

1. Andrew V. Sutherland
2. Yitang Zhang
3. Wouter Castryck
4. Terence Tao

Citations in the corpus

• New equidistribution estimates of Zhang type (2014, background): “chreier equation yp yPpxq{Qpxq: This was rst explicitly stated by Perelmuter in [44], although this was undoubtedly known to Weil; an elementary proof based on Stepanov’s method may also be found in [6]. A full proof for all curves using a minimal amount of theory of algebraic curves is found in [2]”
• Bounded gaps between primes (2014, methodology): “An elementary proof based on Stepanov’s method may also be found in cochrane [6].”