An analytic heuristic for multiplicity computation for Zaremba's conjecture
From MaRDI portal
(Redirected from Publication:1677489)
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 , which arises naturally as a subset of 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 4128915 (Why is no real title available?)
- scientific article; zbMATH DE number 914352 (Why is no real title available?)
- scientific article; zbMATH DE number 3390213 (Why is no real title available?)
- An improvement to Zaremba's conjecture
- An invitation to modern number theory. With a foreword by Peter Sarnak.
- Continued fraction Cantor sets, Hausdorff dimension, and functional analysis
- From Apollonius to Zaremba: local-global phenomena in thin orbits
- On Zaremba's conjecture
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)