Bounding the Largest Inhomogeneous Approximation Constant
Bishnu Paudel, Chris Pinner

TL;DR
This paper establishes optimal lower bounds for the inhomogeneous approximation constant of irrational numbers based on the liminf of their partial quotients, providing precise bounds for various cases.
Contribution
It derives the best possible lower bounds for the inhomogeneous approximation constant in terms of the partial quotients' liminf, extending understanding of inhomogeneous Diophantine approximation.
Findings
For R ≥ 3, ρ(α) ≥ 1/(6√3+8) ≈ 1/18.39.
For R ≥ 4, ρ(α) ≥ 1/(4√3+2) ≈ 1/8.93.
Bounds are optimal when R is even and asymptotically precise when R is odd.
Abstract
For a given irrational number and a real number in one defines the two-sided inhomogeneous approximation constant \begin{equation*} M(\alpha,\gamma):=\liminf_{|n|\rightarrow\infty}|n| ||n\alpha-\gamma||, \end{equation*} and the case of worst inhomogeneous approximation for \begin{equation*} \rho(\alpha):=\sup_{\gamma\notin\mathbb{Z}+\alpha\mathbb{Z}}M(\alpha,\gamma). \end{equation*} We are interested in lower bounds on in terms of where the are the partial quotients in the negative (i.e.\ the `round-up') continued fraction expansion of . We obtain bounds for any which are best possible when is even (and asymptotically precise when is odd). In particular when and when ,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Approximation and Integration · Mathematical functions and polynomials · Numerical Methods and Algorithms
