arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2607.08712math.CO
收藏

吉尔布雷斯猜想:一个克拉默随机模型和确定性分析

Gilbreath's conjecture: a Cramér random model and a deterministic analysis

Kent State University(肯特州立大学);ETH Zurich(苏黎世联邦理工学院);UCLA Department of Mathematics(加州大学洛杉矶分校数学系)

Zachary Chase, Zach Hunter, Terence Tao

AI总结:

研究吉尔布雷斯猜想,通过构建克拉默随机模型证明其类似情况成立,还对相关连续概率模型做初步分析,并给出确定性“逆定理”,分离出该猜想在特定条件下的阻碍因素。

摘要:

吉尔布雷斯猜想断言,若从素数序列开始,逐次取绝对差以创建一个三角阵列,那么该阵列的左对角线在第一行之后全由1组成。本文表明,对于一个克拉默随机模型,此猜想的类似情况成立,其中(归一化的)素数间隔被具有对数大小几何分布的独立随机变量所取代。我们还对该问题相关的连续概率模型进行了一些初步分析,以及给出一个确定性的“逆定理”,它分离出了吉尔布雷斯猜想的特定阻碍(假设素数间隔有克拉默型界),即长的零块,或对于某些\(d\geq2\)的非常长的浅\(\{0,d\}\)值块。

英文摘要:

Gilbreath's conjecture asserts that if one starts with the sequence of primes and takes successive absolute differences to create a triangular array, then the left diagonal of this array consists entirely of ones after the first row. In this paper, we show that the analogue of this conjecture for a Cramér random model holds, in which the (normalized) prime gaps are replaced by independent random variables with geometric distributions of logarithmic size. We also give some preliminary analysis of the associated continuous probabilistic model for this problem, as well as a deterministic "inverse theorem" that isolates the specific obstructions to Gilbreath's conjecture (assuming a Cramér type bound on prime gaps), namely long blocks of zeroes, or very long shallow $\{0,d\}$-valued blocks for some $d \geq 2$.

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

↑