Quantitative Khintchine on the parabola with non-monotonic approximation functions

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.