A random approach to the multibonacci sequence
多波那契数列的随机方法
Hacène Belbachir, Hamza Zeggada
AI总结 通过随机铺砌(使用线性k-骨牌并着色)生成加权多波那契数列,建立随机变量X的分布并计算期望为2^{s+1}-3。
详情
- Comments
- 5 pages, 2 figures
本文提出了一种多波那契数列的随机方法。我们推广了Benjamin、Levin、Mahlburg和Quinn引入的模型,该模型基于使用多米诺骨牌和方块的随机铺砌方法,得到斐波那契数列,并在作者之前的工作中扩展到三波那契情况。我们的方法采用线性$k$-骨牌($k=1,\ldots,s$)铺砌,并结合特定着色,生成加权多波那契数列。对于由该模型定义的自然随机变量$X$,我们建立了$X$关于多波那契数的分布,并计算了$\mathbb{E}[X] = 2^{s+1}-3$。
This paper presents a random approach to the multibonacci sequence. We generalise the model introduced by Benjamin, Levin, Mahlburg, and Quinn, which is based on a random tiling method using dominoes and squares that leads to the Fibonacci sequence, and which was extended to the tribonacci case in a previous work by the authors. Our approach employs tiling with linear $k$-ominoes, $k=1,\ldots,s$, combined with specific colouring, to generate a weighted multibonacci sequence. For a natural random variable~$X$ defined by this model, we establish the distribution of $X$ in terms of multibonacci numbers and compute $\mathbb{E}[X] = 2^{s+1}-3$.