当前位置: X-MOL 学术Discret. Math. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
On the number of gaps of sequences with Poissonian pair correlations
Discrete Mathematics ( IF 0.8 ) Pub Date : 2021-07-30 , DOI: 10.1016/j.disc.2021.112555
Christoph Aistleitner 1 , Thomas Lachmann 1 , Paolo Leonetti 1 , Paolo Minelli 1
Affiliation  

A sequence (xn) on the unit interval is said to have Poissonian pair correlation if #{1ijN:xixjs/N}=2sN(1+o(1)) for all reals s>0, as N. It is known that, if (xn) has Poissonian pair correlations, then the number g(n) of different gap lengths between neighboring elements of {x1,,xn} cannot be bounded along any index subsequence (nt). First, we improve this by showing that, if (xn) has Poissonian pair correlations, then the maximum among the multiplicities of the neighboring gap lengths of {x1,,xn} is o(n), as n. Furthermore, we show that for every function f:N+N+ with limnf(n)= there exists a sequence (xn) with Poissonian pair correlations such that g(n)f(n) for all sufficiently large n. This answers negatively a question posed by G. Larcher.



中文翻译:

关于具有泊松对相关性的序列间隙数

一个序列 (Xn) 在单位区间上被称为具有泊松对相关性,如果 #{1一世jNX一世-Xj/N}=2N(1+(1)) 对于所有实数 >0, 作为 N. 据了解,如果(Xn) 具有泊松对相关性,那么数 G(n) 相邻元素之间的不同间隙长度 {X1,,Xn} 不能沿着任何索引子序列有界 (n). 首先,我们通过证明,如果(Xn) 具有泊松对相关性,那么相邻间隙长度的多重性中的最大值 {X1,,Xn}(n), 作为 n. 此外,我们证明对于每个函数FN+N+nF(n)= 存在一个序列 (Xn) 具有泊松对相关性,使得 G(n)F(n)对于所有足够大的n。这否定了 G. Larcher 提出的问题。

更新日期:2021-07-30
down
wechat
bug