Back to search
2103.15962

DISTRIBUTION OF THE REDUCED QUADRATIC IRRATIONALS ARISING FROM THE ODD CONTINUED FRACTION EXPANSION

Maria Siskaki

incompletemedium confidence
Category
Not specified
Journal tier
Specialist/Solid
Processed
Sep 28, 2025, 12:56 AM

Audit review

Core steps match (matrix encoding, fixed-point/eigenvalue identities, natural-extension density), but both treatments mishandle the ordering parameter. The paper states results for length %o(ω)=2 log r(Ω̃(ω)) yet proves asymptotics under a trace cutoff Tr(Ω̃)≤N, using Lemma 11 to claim the replacement is ‘negligible’; this is not dimensionally consistent, since %o≤N corresponds to Tr≤e^{N/2}, not Tr≤N (see the statement of Theorem 4 and the subsequent switch to trace-based sets W and S̃e with Tr≤N) . The model repeats the same issue in a different guise, replacing the exponential spectral-radius cutoff by a linear C≲N and asserting that this only changes normalization, which is unjustified. Constants and window measures agree (µ̃o=(3 log G)^{-1}(x+y)^{-2} on [1,∞)×[G−2,G], and the final factor 1/(4ζ(2))), and the paper’s lattice-point analysis on modular hyperbolas yields the correct trace-ordered main term and power-saving error O(N^{3/2+ε}) . But as written, the paper’s statement conflates ‘length ≤ N’ with ‘trace ≤ N’, and the model’s reduction from λ≤e^{N/2} to C≲N is also incorrect. Hence, both are incomplete: the paper needs a precise reconciliation of length vs trace, and the model needs a correct handling of the cutoff and subgroup/parity structure.

Referee report (LaTeX)

\textbf{Recommendation:} major revisions

\textbf{Journal Tier:} specialist/solid

\textbf{Justification:}

The manuscript’s arithmetic and combinatorial machinery for OCF is strong and yields a clean N\^2 asymptotic with a power-saving error under a trace cutoff. However, it currently states the main result under a length (spectral-radius) cutoff and invokes a trace–spectral radius comparison that does not validate replacing an exponential threshold by a linear one. The statement must be corrected (or the bridge rigorously supplied) to ensure correctness.