An integer sequence is said to be 3-free if no three elements form an arithmetic progression. Following the greedy algorithm, the Stanley sequence $S(a_0,a_1,\ldots,a_k)$ is defined to be the 3-free sequence $\{a_n\}$ having initial terms $a_0,a_1,\ldots,a_k$ and with each subsequent term $a_n>a_{n-1}$ chosen minimally such that the 3-free condition is not violated. Odlyzko and Stanley conjectured that Stanley sequences divide into two classes based on asymptotic growth patterns, with one class of highly structured sequences satisfying $a_n\approx Θ(n^{\log_2 3})$ and another class of seemingly chaotic sequences obeying $a_n=Θ(n^2/\log n)$. We propose a rigorous definition of regularity in Stanley sequences based on local structure rather than asymptotic behavior and show that our definition implies the corresponding asymptotic property proposed by Odlyzko and Stanley. We then construct many classes of regular Stanley sequences, which include as special cases all such sequences previously identified. We show how two regular sequences may be combined into another regular sequence, and how parts of a Stanley sequence may be translated while preserving regularity. Finally, we demonstrate that certain Stanley sequences possess proper subsets that are also Stanley sequences, a situation that appears previously to have been assumed impossible.
Stanley和Odlyzko提出了一种无3项等差数列集合的广义构造方法。据推测,此类序列之间存在二分法:那些具有周期结构的序列满足某些递归关系,而其他序列则显得混乱。具有这些周期性行为的一大类序列被称为具有两个参数的独立序列,一个特征和一个增长因子。Rolnick指出,除了整数的有限集之外,所有的整数都可以作为独立序列的特征来实现。以前,已知的唯一一大类整数是字符,其中以3为底的表示仅由数字0和2组成。本文通过证明所有与244 mod 486不全等的偶数都可以作为字符来实现,从而证明所有字符的集合具有正的较低密度,从而大大改进了这一结果。
How to Use Deep Learning to Identify Sufficient Conditions: A Case Study on Stanley's $e$-Positivity
Research Center for Mathematics and Interdisciplinary Sciences, Shandong University(山东大学数学交叉前沿研究中心);Frontiers Science Center for Nonlinear Expectations, Ministry of Education(教育部非线性期望前沿科学中心)