关于鄂尔多斯离散问题
On the Erdos Discrepancy Problem
摘要:
根据埃尔德什差异猜想,对于任何无限的$\pm 1$序列,都存在无界差异的齐次算术数列。换句话说,对于任何$\pm 1$序列$(x_1,x_2,...)$和差异$C$,存在整数$m$和$d$,使得$|\sum_{i=1}^m x_{i \cdot d}| > C$。这是一个$80$岁的开放问题,最近的发展证明,这一猜想是正确的差异$2$。Paul Erdans还指出,这种无界差异的性质甚至适用于完全乘法序列(CMS)的限制情况,即序列$(x_1,x_2,...)$,其中$x_{a \cdot b} = x_{a} \cdot x_{b}$对于任何$a,b \geq 1$。具有差异$2$的最长CMS已被证明具有大小$246$。本文证明了任意长度为$127,646$或大于$127,646$的完全乘法序列至少有$4$的差异,从而证明了对于差异小于$3$的完全乘法序列的Erdés差异猜想.此外,我们证明,这个界是紧的,并增加了最长的已知序列的差异$3$从$17,000$到$127,645$的大小。最后,我们提供了归纳构造规则以及简化方法,以提高更高的差异序列的下限。
英文摘要:
According to the Erdős discrepancy conjecture, for any infinite $\pm 1$ sequence, there exists a homogeneous arithmetic progression of unbounded discrepancy. In other words, for any $\pm 1$ sequence $(x_1,x_2,...)$ and a discrepancy $C$, there exist integers $m$ and $d$ such that $|\sum_{i=1}^m x_{i \cdot d}| > C$. This is an $80$-year-old open problem and recent development proved that this conjecture is true for discrepancies up to $2$. Paul Erdős also conjectured that this property of unbounded discrepancy even holds for the restricted case of completely multiplicative sequences (CMSs), namely sequences $(x_1,x_2,...)$ where $x_{a \cdot b} = x_{a} \cdot x_{b}$ for any $a,b \geq 1$. The longest CMS with discrepancy $2$ has been proven to be of size $246$. In this paper, we prove that any completely multiplicative sequence of size $127,646$ or more has discrepancy at least $4$, proving the Erdős discrepancy conjecture for CMSs of discrepancies up to $3$. In addition, we prove that this bound is tight and increases the size of the longest known sequence of discrepancy $3$ from $17,000$ to $127,645$. Finally, we provide inductive construction rules as well as streamlining methods to improve the lower bounds for sequences of higher discrepancies.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。