arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1408.4710math.CO
收藏

关于Stanley序列的增长性

On the growth of Stanley sequences

David Rolnick, Praveen S. Venkataramana

摘要:

如果没有三个元素构成一个等差数列,则称一个集合为\emph{3-free}。给定整数$0=a_0<a_1<\cdots<a_t$的3-free集合$A$,使用贪婪算法定义\emph{Stanley sequence} $S(A)=\{a_n\}$:对于每个连续的$n>t$,我们选择最小的可能$a_n$,使得$\{a_0,a_1,\ldots,a_n\}$是3-free且递增的。Odlyzko和Stanley的工作表明Stanley序列可以分为两类。类型1的序列是高度结构化的,并且满足$αn^{\log_2 3}/2\le a_n\le αn^{\log_2 3}$,对于某些恒定的$α$,而类型2的序列是混沌的,并且满足$Θ(n^2/\log n)$。在本文中,我们考虑$α$的可能值的增长1型斯坦利序列。而Odlyzko和斯坦利假设$α=1$,我们表明,$α$可以是任何有理数,至少是1和分母,在最低的条款,是一个权力的3。

英文摘要:

A set is said to be \emph{3-free} if no three elements form an arithmetic progression. Given a 3-free set $A$ of integers $0=a_0<a_1<\cdots<a_t$, the \emph{Stanley sequence} $S(A)=\{a_n\}$ is defined using the greedy algorithm: For each successive $n>t$, we pick the smallest possible $a_n$ so that $\{a_0,a_1,\ldots,a_n\}$ is 3-free and increasing. Work by Odlyzko and Stanley indicates that Stanley sequences may be divided into two classes. Sequences of Type 1 are highly structured and satisfy $αn^{\log_2 3}/2\le a_n\le αn^{\log_2 3}$, for some constant $α$, while those of Type 2 are chaotic and satisfy $Θ(n^2/\log n)$. In this paper, we consider the possible values for $α$ in the growth of Type 1 Stanley sequences. Whereas Odlyzko and Stanley assumed $α=1$, we show that $α$ can be any rational number which is at least 1 and for which the denominator, in lowest terms, is a power of 3.

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

↑