Papers
Topics
Authors
Recent
Search
2000 character limit reached

On a counting theorem for weakly admissible lattices

Published 9 May 2019 in math.NT | (1905.03568v1)

Abstract: We give a precise estimate for the number of lattice points in certain bounded subsets of $\mathbb{R}{n}$ that involve `hyperbolic spikes' and occur naturally in multiplicative Diophantine approximation. We use Wilkie's o-minimal structure $\mathbb{R}_{\exp}$ and expansions thereof to formulate our counting result in a general setting. We give two different applications of our counting result. The first one establishes nearly sharp upper bounds for sums of reciprocals of fractional parts, and thereby sheds light on a question raised by L^e and Vaaler, extending previous work of Widmer and of the author. The second application establishes new examples of linear subspaces of Khintchine type thereby refining a theorem by Huang and Liu. For the proof of our counting result we develop a sophisticated partition method which is crucial for further upcoming work on sums of reciprocals of fractional parts over distorted boxes.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.