arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1209.3201math.COcs.DM
收藏

相同长度路径乘积的带宽

Bandwidth of the product of paths of the same length

Louis J. Billera, Saúl A. Blanco

摘要:

本文给出了一条具有$n$边的路的$d$ -积的带宽$bw(P_{n}^{d})$的一个数值表达式$P_{n}^{d}$ .我们证明,这个带宽是由某些多项式系数的总和。我们还表明,$bw(P_{n}^{d})$是有界的上方和下方的最大系数的扩展$(1+x+...+x^{n})^{k}$,与$k\in{d,d+1}$。此外,我们比较了$bw(P_{n}^{d})$的渐近行为与通过按字典顺序对$P_{n}^{d}$的顶点进行排序而获得的标记的带宽。

英文摘要:

In this note we give a numerical expression for the bandwidth $bw(P_{n}^{d})$ of the $d$-product of a path with $n$ edges, $P_{n}^{d}$. We prove that this bandwidth is given by the sum of certain multinomial coefficients. We also show that $bw(P_{n}^{d})$ is bounded above and below by the largest coefficient in the expansion of $(1+x+...+x^{n})^{k}$, with $k\in{d,d+1}$. Moreover, we compare the asymptotic behavior of $bw(P_{n}^{d})$ with the bandwidth of the labeling obtained by ordering the vertices of $P_{n}^{d}$ in lexicographic order.

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

↑