Seed-bank population recurrence (source code)

= Seed-bank population recurrence
{title2=$M_{n+1}=N(aM_n+bM_{n-1})$}

A <seed-bank population recurrence> includes delayed recruitment from seeds that survive more than one season. For $a,b\ge0$, recruitment function $N$ with $N(0)=0$ and $N'(0)=1$ gives extinction multipliers solving $\lambda^2-a\lambda-b=0$. If $N$ is strictly concave, bounded and increasing, a positive fixed point exists uniquely exactly when $a+b>1$; it solves $M=N((a+b)M)$. The dominant extinction multiplier then exceeds one.