2000 character limit reached
Quantitative Diophantine approximation with congruence conditions
Published 12 Nov 2020 in math.NT | (2011.06360v1)
Abstract: In this short paper we prove a quantitative version of the Khintchine-Groshev Theorem with congruence conditions. Our argument relies on a classical argument of Schmidt on counting generic lattice points, which in turn relies on a certain variance bound on the space of lattices.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.