It is known that for an IP${^\star}$ set $A$ in $\mathbb{N}$ and a sequence $< x_{n}>_{n=1}^{\infty}$ there exists a sum subsystem $< y_{n}>_{n=1}^{\infty}$ of $< x_{n}>_{n=1}^{\infty}$ such that
$FS(< y_n>_{n=1}^\infty)\cup FP(< y_n>_{n=1}^\infty)\subseteq A$. Similar types of results also have been proved for central* sets where the sequences have been taken from the class of minimal sequences. In this present work we will prove some analogues results for C$^{\star}$-sets for a more general class of sequences.
The expected values, variances and limiting distributions of Gutman index, Schultz index, multiplicative degree-Kirchhoff index and additive degree-Kirchhoff index for a class of random chain networks
The expected values and limiting behaviours for the Gutman index, Schultz index, multiplicative degree-Kirchhoff index and additive degree-kirchhoff index of a random cyclooctane chain
A new encoding of coalescent processes. Applications to the additive and multiplicative cases
我们重新审视离散的加法和乘法聚结,从单位质量的$n$粒子开始。已知这些情况与一些“组合合并过程”有关:在加法情况下,凯莱树的碎片或停车方案的时间反转,以及乘法情况下的随机图过程$(G(n,p))_p$。在时间固定的情况下,将这些组合对象编码到由直线索引的实值过程中,是将质量的渐近行为描述为$n\to +\infty$的关键。我们建议在顶点上使用Prim顺序而不是经典的宽度优先(或深度优先)遍历来编码组合合并过程。在加法的情况下,这在过程的不同表示之间产生了有趣的联系。在乘法的情况下,它允许一个回答一个更强的版本的一个开放的问题奥尔德斯[安。第25卷,第100页。812- 854,1997年]:我们证明,不仅序列的(重标度)质量,被看作是一个由时间$λ$索引的过程,在分布上收敛到具有抛物线漂移$(B_t+λt - t^2/2, t\geq 0)$的布朗运动的当前最小值以上的偏移长度的重新排序序列,但我们也构建了Bhamidi的标准增广乘法合并的版本,Budhiraja and Wang [Probab.理论关系,出现]使用附加的泊松点过程。