Sarkozy's theorem in function fields
<p>Sárközy proved that dense sets of integers contain two elements differing by a kth power. The bounds in quantitative versions of this theorem are rather weak compared to what is expected. We prove a version of Sárközy’s theorem for polynomials over Fq with polynomial dependencies in the par...
| Main Author: | |
|---|---|
| Format: | Journal article |
| Published: |
Oxford University Press
2016
|