The Combinatorialization of Linear Recurrences
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
Electronic Journal Of Combinatorics
Open Access Journal; policy not available in SHERPA/RoMEO
Benjamin, Arthur T.; Derks, Halcyon; and Quinn, Jennifer J., "The Combinatorialization of Linear Recurrences" (2011). SIAS Faculty Publications. 211.