Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
140 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Littlewood and Duffin--Schaeffer-type problems in diophantine approximation (2010.09069v2)

Published 18 Oct 2020 in math.NT

Abstract: Gallagher's theorem describes the multiplicative diophantine approximation rate of a typical vector. We establish a fully-inhomogeneous version of Gallagher's theorem, a diophantine fibre refinement, and a sharp and unexpected threshold for Liouville fibres. Along the way, we prove an inhomogeneous version of the Duffin--Schaeffer conjecture for a class of non-monotonic approximation functions.

Summary

We haven't generated a summary for this paper yet.