An analytic heuristic for multiplicity computation for Zaremba's conjecture

From MaRDI portal
Publication:1677489

DOI10.1016/J.JNT.2017.08.016zbMATH Open1420.11102arXiv1608.08690OpenAlexW2963528747WikidataQ123147610 ScholiaQ123147610MaRDI QIDQ1677489FDOQ1677489


Authors: Peter Cohen Edit this on Wikidata


Publication date: 21 November 2017

Published in: Journal of Number Theory (Search for Journal in Brave)

Abstract: Zaremba's Conjecture concerns the formation of continued fractions with partial quotients restricted to a given alphabet. In order to answer the numerous questions that arrive from this conjecture, it is best to consider a semi-group, often denoted GammaA, which arises naturally as a subset of SL2(mathbbZ) when considering finite continued fractions. To translate back from this semi-group into rational numbers, we select a projection mapping satisfying certain criteria to recover the numerator and denominator of the continued fractions in rational form. The central question of our research is to determine the multiplicity of a given denominator. To this end, we develop a heuristic method similar to the Hardy-Littlewood Circle Method. We compare this theoretical model to the exact data, gleaned by simulation, and demonstrate that our formula appears to be asymptotically valid. We then evaluate different aspects of the accuracy of our formula.


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




Recommendations




Cites Work






This page was built for publication: An analytic heuristic for multiplicity computation for Zaremba's conjecture

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