Rigorous first-hitting-time asymptotics for near-edge zeros

Establish rigorous upper bounds, or prove the predicted asymptotic behavior, for the least height at which the Fibonacci zeta function has a zero whose real part lies within a prescribed distance of the right edge; specifically, determine whether \(\log T_F(\varepsilon)\sim(4\sigma_F\log\varphi)^{-1}(\log(1/\varepsilon))^2\) as \(\varepsilon\downarrow0\).

Background

The paper proves a polynomial lower bound for the least height TF(ε)T_F(\varepsilon) of a zero whose real part lies within ε\varepsilon of the right edge σF\sigma_F. It also derives a shrinking-target model in which near-edge zeros correspond to a growing-dimensional Kronecker flow entering increasingly small phase neighborhoods.

The resulting heuristic predicts superpolynomial but subexponential growth, with logTF(ε)\log T_F(\varepsilon) asymptotic to (4σFlogφ)1(log(1/ε))2(4\sigma_F\log\varphi)^{-1}(\log(1/\varepsilon))^2. The paper explains that proving this requires quantitative recurrence estimates for logarithms of primes in a dimension growing like log(1/ε)\log(1/\varepsilon), which are not supplied by the existing argument.

References

We do not prove eq:T-heuristic: first-hitting times of a deterministic Kronecker flow can fluctuate with its Diophantine recurrence.

eq:T-heuristic:

logTF(ε)(log(1/ε))24σFlogφ=0.6990679724(log(1/ε))2.\log T_F(\varepsilon) \sim\frac{(\log(1/\varepsilon))^2}{4\sigma_F\log\varphi} =0.6990679724\ldots\,(\log(1/\varepsilon))^2.

The Right Edge of the Zero Set of the Fibonacci Zeta Function  (2609.04993 - Mantovanelli, 4 Sep 2026) in Remark 2.14, Section 6 ("Approach to the right edge: phase locking and height")