Quantitative Khintchine on the parabola with non-monotonic approximation functions
Maiken Gravgaard, Simon Kristensen
Abstract
We prove a quantitative version of the convergence case of Khintchine's celebrated theorem in metric Diophantine approximation, but where the approximated points are restricted to lying on the parabola. A novel feature of our result is that unlike other results in literature, the approximating function is no longer required to be monotonic. This requires us to obtain explicit constants in classical number theoretic results, most notably in Burgess' bound for character sums in short intervals.
Create a lesson
Related papers
Explicit equations of Galois subfields of Hermitian function fields with respect to decomposition groups
Liming Ma, Yipeng Wang
Tunnell-type criteria for variants of the congruent number problem
Bo-Hae Im, Minseo Shin
A uniform effective André--Oort result
Guy Fowler
On a conjecture of Browning and Sawin on random hypersurfaces with sign coefficients
Ken Ono, Ashvin Swaminathan
On Multiple Eisenstein Series in Positive Characteristic: Direct Sum Result
Chieh-Yu Chang, Song-Yun Chen, Fei-Jun Huang et al.
Stable Trace Formula for Newton strata of Shimura varieties
Dhruva Kelkar