The Combinatorialization of Linear Recurrences
Arthur T. Benjamin, Halcyon C. Derks, Jennifer J. Quinn · The Electronic Journal of Combinatorics · 2011
Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.
The Electronic Journal of Combinatorics · Electronic Journal of Combinatorics · article · 2011
Abstract
We provide two combinatorial proofs that linear recurrences with constant coefficients have a closed form based on the roots of its characteristic equation. The proofs employ sign-reversing involutions on weighted tilings.
Open the resolved locator · 10.37236/2008
Metadata licence: OpenAlex metadata (CC0)