两类模$p$ -Stanley序列
Two classes of modular $p$-Stanley sequences
摘要:
考虑一个没有$p$素数的$p$项等差数列的集合$A$。集合$A$的$p$ -Stanley序列是通过将不创建$p$ -项算术级数的连续整数进行gretune相加而生成的。对于$p>3$素数,我们给出了$p$ -Stanley序列的两种不同的构造,这些序列具有正则结构并满足一定的条件,以便成为模$p$ -Stanley序列,这是Moy和Rolnick定义的一组特别好的序列,它们总是具有正则结构. Odlyzko和Stanley指出,$\{0,n\}$生成的3-Stanley序列只有在$n=3^k$或$n=2\cdot 3^k$的情况下才具有规则结构。对于$p>3$,我们发现一个大得多的一类整数$n$,使$p$ -斯坦利序列产生的$\{0,n\}$是一个模块化的$p$ -斯坦利序列和数字证据所给予的莫伊和Rolnick表明,这些是唯一的$n$的$p$ -斯坦利序列产生的$\{0,n\}$是一个模块化的$p$ -斯坦利序列。我们的第二类是一个推广的建设Rolnick为$p=3$和主题类似的建设Rolnick。
英文摘要:
Consider a set $A$ with no $p$-term arithmetic progressions for $p$ prime. The $p$-Stanley sequence of a set $A$ is generated by greedily adding successive integers that do not create a $p$-term arithmetic progression. For $p>3$ prime, we give two distinct constructions for $p$-Stanley sequences which have a regular structure and satisfy certain conditions in order to be modular $p$-Stanley sequences, a set of particularly nice sequences defined by Moy and Rolnick which always have a regular structure. Odlyzko and Stanley conjectured that the 3-Stanley sequence generated by $\{0,n\}$ only has a regular structure if $n=3^k$ or $n=2\cdot 3^k$. For $p>3$ we find a substantially larger class of integers $n$ such that the $p$-Stanley sequence generated from $\{0,n\}$ is a modular $p$-Stanley sequence and numerical evidence given by Moy and Rolnick suggests that these are the only $n$ for which the $p$-Stanley sequence generated by $\{0,n\}$ is a modular $p$-Stanley sequence. Our second class is a generalization of a construction of Rolnick for $p=3$ and is thematically similar to the analogous construction by Rolnick.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。