paper

Quantitative longest-run laws for partial quotients

arXiv:2602.11462

Abstract

Two longest-run statistics are studied: the longest run of a fixed value and the longest run over all values. Under quantitative mixing and exponential cylinder estimates for constant words, a general theorem is proved. Quantitative almost-sure logarithmic growth is obtained, and eventual two-sided bounds with double-logarithmic error terms are established. For continued-fraction partial quotients, explicit centring constants and double-logarithmic error bounds are derived for both statistics.

Quantitative longest-run laws for partial quotients · wovepaper