English

On a Generalized Fibonacci Recurrence

Combinatorics 2020-01-01 v2 Populations and Evolution

Abstract

The generalized Fibonacci recurrence gn=gnk+gnmg_n=g_{n-k}+g_{n-m} was recently used to demonstrate the theoretically optimal nature of limited senescence in morphologically symmetrically dividing bacteria. Here, we study this recurrence from a more abstract viewpoint, as a general model for asymmetric branching, and interpret solutions for different initial conditions in terms of branching-related quantities. We provide a compact diagrammatic representation for the evolution of this process which leads to an explicit binomial identity for the sums of elements lying on the diagonals kx+my=nkx+my=n in Pascal's triangle N0×N0(x,y)(x+yx)\mathbb N_0\times \mathbb N_0\ni(x,y)\mapsto {x+y\choose x}, previously sought by Dickinson [Dic50], Raab [Raa63], and Green [Gre68].

Keywords

Cite

@article{arxiv.1901.04080,
  title  = {On a Generalized Fibonacci Recurrence},
  author = {Natasha Blitvić and Vicente I. Fernandez},
  journal= {arXiv preprint arXiv:1901.04080},
  year   = {2020}
}

Comments

This manuscript (v2) is the combinatorics-focused version of an earlier paper (v1), which combined combinatorics with biology. Biological aspects are now discussed in a separate manuscript

R2 v1 2026-06-23T07:10:21.605Z