The Combinatorialization of Linear Recurrences

  • Arthur T. Benjamin
  • Halcyon Derks
  • Jennifer J. Quinn
DOI: https://doi.org/10.37236/2008

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.

Published
2011-06-11
How to Cite
Benjamin, A. T., Derks, H., & Quinn, J. J. (2011). The Combinatorialization of Linear Recurrences. The Electronic Journal of Combinatorics, 18(2), P12. https://doi.org/10.37236/2008
Issue
Volume 18, Issue 2 (2011-2) (The Zeilberger Festschrift volume)
Article Number
P12