Odd-odd continued fraction algorithm
From MaRDI portal
Publication:2139193
DOI10.1007/S00605-022-01704-2zbMATH Open1497.11178arXiv2002.06310OpenAlexW3006248430MaRDI QIDQ2139193FDOQ2139193
Seul Bee Lee, Lingmin Liao, Dong Han Kim
Publication date: 17 May 2022
Published in: Monatshefte für Mathematik (Search for Journal in Brave)
Abstract: By using a jump transformation associated to the Romik map, we define a new continued fraction algorithm called odd-odd continued fraction, whose principal convergents are rational numbers of odd denominators and odd numerators. Among others, it is proved that all the best approximating rationals of odd denominators and odd numerators of an irrational number are given by the principal convergents of the odd-odd continued fraction algorithm and vice versa.
Full work available at URL: https://arxiv.org/abs/2002.06310
Recommendations
Continued fractions and generalizations (11J70) Dynamical systems involving maps of the interval (37E05)
Cites Work
- Title not available (Why is that?)
- A new class of continued fraction expansions
- Title not available (Why is that?)
- The Modular Surface and Continued Fractions
- Title not available (Why is that?)
- Algorithms with mediant convergents and their metrical theory
- Title not available (Why is that?)
- Continued fractions and parametric geometry of numbers
- Geodesics on modular surfaces and continued fractions
- The theta group and the continued fraction expansion with even partial quotients
- The Modular Tree of Pythagoras
- The dynamics of Pythagorean Triples
- Title not available (Why is that?)
- Coding of geodesics on some modular surfaces and applications to odd and even continued fractions
- Quadratic forms and their Berggren trees
- Billiards on Pythagorean triples and their Minkowski functions
- Even-Integer Continued Fractions and the Farey Tree
- Number theoretical properties of Romik's dynamical system
Cited In (1)
This page was built for publication: Odd-odd continued fraction algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139193)