Skip to main content Accessibility help
×
Home

WEAK ADMISSIBILITY, PRIMITIVITY, O-MINIMALITY, AND DIOPHANTINE APPROXIMATION

Abstract

We generalize Skriganov’s notion of weak admissibility for lattices to include standard lattices occurring in Diophantine approximation and algebraic number theory, and we prove estimates for the number of lattice points in sets such as aligned boxes. Our result improves on Skriganov’s celebrated counting result if the box is sufficiently distorted, the lattice is not admissible, and, e.g., symplectic or orthogonal. We establish a criterion under which our error term is sharp, and we provide examples in dimensions $2$ and $3$ using continued fractions. We also establish a similar counting result for primitive lattice points, and apply the latter to the classical problem of Diophantine approximation with primitive points as studied by Chalk, Erdős, and others. Finally, we use o-minimality to describe large classes of sets to which our counting results apply.

  • View HTML
    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      WEAK ADMISSIBILITY, PRIMITIVITY, O-MINIMALITY, AND DIOPHANTINE APPROXIMATION
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      WEAK ADMISSIBILITY, PRIMITIVITY, O-MINIMALITY, AND DIOPHANTINE APPROXIMATION
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      WEAK ADMISSIBILITY, PRIMITIVITY, O-MINIMALITY, AND DIOPHANTINE APPROXIMATION
      Available formats
      ×

Copyright

References

Hide All
1. Barroero, F., Counting algebraic integers of fixed degree and bounded height. Monatsh. Math. 175(1) 2014, 2541.
2. Barroero, F., Algebraic s-integers of fixed degree and bounded height. Acta Arith. 167(1) 2015, 6790.
3. Barroero, F. and Widmer, M., Counting lattice points and o-minimal structures. Int. Math. Res. Not. IMRN 2014 2014, 49324957.
4. Chalk, J. H. H. and Erdős, P., On the distribution of primitive lattice points in the plane. Canad. Math. Bull. 2 1959, 9196.
5. Dani, S. G., Laurent, M. and Nogueira, A., Multi-dimensional metric approximation by primitive points. Math. Z. 279(3–4) 2015, 10811101.
6. Frei, C., Loughran, D. and Sofos, E., Rational points of bounded height on general conic bundle surfaces. Proc. Lond. Math. Soc. (3) 2018, doi: 10.1112/plms.12134.
7. Frei, C. and Pieropan, M., O-minimality on twisted universal torsors and Manin’s conjecture over number fields. Ann. Sci. Éc. Norm. Supér. 49(4) 2016, 757811.
8. Frei, C. and Sofos, E., Counting rational points on smooth cubic surfaces. Math. Res. Lett. 23(1) 2016, 127143.
9. Frei, C. and Sofos, E., Generalised divisor sums of binary forms over number fields. J. Inst. Math. Jussieu (to appear).
10. Laurent, M. and Nogueira, A., Inhomogeneous approximation with coprime integers and lattice orbits. Acta Arith. 154(4) 2012, 413427.
11. Pila, J. and Wilkie, A., The rational points of a definable set. Duke Math. J. 133 2006, 591616.
12. Scanlon, T., A proof of the André–Oort conjecture using mathematical logic [after Pila, Wilkie and Zannier]. In Séminaire Bourbaki, Vol. 2010/2011, Exposés 1027–1042 (Astérisque 348 ), Société Mathématique de France (2012), Exp. No. 1037, ix, 299–315.
13. Scanlon, T., O-minimality as an approach to the André-Oort conjecture. In Around the Zilber–Pink Conjecture (Panoramas et Synthéses 52 ), Société Mathématique de France (2017), 111165.
14. Schmidt, W. M., Badly approximable systems of linear forms. J. Number Theory 1 1969, 139154.
15. Schmidt, W. M., Irregularities of distribution. VII. Acta Arith. 21 1972, 4550.
16. Skriganov, M. M., Constructions of uniform distributions in terms of geometry of numbers. Algebra Analiz. 6(3) 1994, 200230.
17. Skriganov, M. M., Ergodic theory on SL(n), diophantine approximations and anomalies in the lattice point problem. Invent. Math. 132 1998, 172.
18. Spain, P. G., Lipschitz: a new version of an old principle. Bull. Lond. Math. Soc. 27 1995, 565566.
19. Technau, N. and Widmer, M., A note on Skriganov’s counting theorem. Submitted.
20. van den Dries, L., Tame Topology and o-Minimal Structures (London Mathematical Society Lecture Note Series 248 ), Cambridge University Press (Cambridge, 1998).
21. Widmer, M., Counting primitive points of bounded height. Trans. Amer. Math. Soc. 362 2010, 47934829.
22. Widmer, M., Lipschitz class, narrow class, and counting lattice points. Proc. Amer. Math. Soc. 140(2) 2012, 677689.
23. Wilkie, A. J., o-minimal structures. In Séminaire Bourbaki, Vol. 2007/2008 (Astérisque 326 ), Société Mathématique de France (2009), Exp. No. 985, vii, 131–142.
MathJax
MathJax is a JavaScript display engine for mathematics. For more information see http://www.mathjax.org.

MSC classification

WEAK ADMISSIBILITY, PRIMITIVITY, O-MINIMALITY, AND DIOPHANTINE APPROXIMATION

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed