arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2603.18243math.NTcs.ITmath.IT
收藏

为何8%的本福特定理序列永不收敛

Why Eight Percent of Benford Sequences Never Converge

Tulane University(杜兰大学)

James M. Hyman

AI总结:

本研究通过条件互信息分析整数基的本福特定理序列,发现8.4%的基在样本深度N=10000时表现出持久相关性,进一步验证5.3%为真正持久,揭示了CMI偏差受分布误差限制,并推断持久率收敛至1/12。

摘要:

我们研究了整数基2≤b≤1000的本福特定理序列b^n的多数字相关性,通过条件互信息(CMI)测量依赖性。从log_10(b)的连分数展开中导出的共振比将基分为收敛和持久区域(定理3.13):在调查的996个基中,84个(8.4%)在样本深度N=10,000时表现出持久相关性,进一步计算到N=200,000确认53个(5.3%)为真正持久。我们证明CMI偏差受分布误差限制(定理3.4);在2988个测试案例中计算证实有效缩放为二次,得出有界类型基的有效速率beta=2(在计算验证的Hessian正性条件下)。在774个收敛基中观测到的有效指数为beta_eff=1.72±0.19,与有限样本修正后的渐进行为一致。我们推测持久率收敛至1/12,这一预测基于高斯-库兹明分布的不完全商。对于持久基,收敛阈值N_epsilon在标准精度下超过10^6,使渐近极限在我们的计算范围内无实际意义。

英文摘要:

We study multi-digit correlations in Benford sequences b^n for integer bases 2 <= b <= 1000, measuring dependence via conditional mutual information (CMI). A resonance ratio derived from the continued fraction expansion of log_10(b) classifies bases into convergent and persistent regimes (Theorem 3.13): among 996 bases surveyed, 84 (8.4%) exhibit persistent correlations at sample depth N = 10,000, and extended computation to N = 200,000 confirms 53 (5.3%) as genuinely persistent. We prove that CMI deviation is bounded by the distribution error (Theorem 3.4); exhaustive computation across 2,988 test cases confirms that the effective scaling is quadratic, yielding a two-sided rate beta = 2 for bounded-type bases (conditional on a computationally verified Hessian positivity condition). The observed effective exponent across 774 convergent bases is beta_eff = 1.72 +/- 0.19, consistent with finite-sample corrections to the asymptotic rate. We conjecture that the persistence rate converges to 1/12, a prediction grounded in the Gauss-Kuzmin distribution of partial quotients. For persistent bases, the convergence threshold N_epsilon exceeds 10^6 at standard precision, rendering the asymptotic limit observationally irrelevant within our computational scope.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑