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

From MaRDI portal
Publication:3176205

DOI10.1112/S0025579318000049zbMATH Open1401.11113arXiv1612.09467OpenAlexW2963618869MaRDI QIDQ3176205FDOQ3176205


Authors: Martin Widmer Edit this on Wikidata


Publication date: 19 July 2018

Published in: Mathematika (Search for Journal in Brave)

Abstract: We generalise M. M. 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, ErdH{o}s, and others. Finally, we use o-minimality to describe large classes of sets


Full work available at URL: https://arxiv.org/abs/1612.09467




Recommendations




Cites Work


Cited In (4)





This page was built for publication: WEAK ADMISSIBILITY, PRIMITIVITY, O‐MINIMALITY, AND DIOPHANTINE APPROXIMATION

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3176205)