Article
The Combinatorialization of Linear Recurrences
Electronic Journal Of Combinatorics
Publication Date
6-11-2011
Document Type
Article
Abstract
We provide two combinatorial proofs that linear recurrences with constant co-efficients have a closed form based on the roots of its characteristic equation. The proofs employ sign-reversing involutions on weighted tilings
Publisher Policy
open access
Citation Information
Arthur T. Benjamin, Halcyon Derks and Jennifer J. Quinn. "The Combinatorialization of Linear Recurrences" Electronic Journal Of Combinatorics Vol. 18 Iss. 2 (2011) p. P12 Available at: http://works.bepress.com/jennifer_quinn/24/