The combinatorialization of linear recurrences
The electronic journal of combinatorics, The Zeilberger Festschrift volume, Tome 18 (2011) no. 2
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.
DOI :
10.37236/2008
Classification :
05A19, 11B37
Mots-clés : sign-reversing involutions on weighted tilings
Mots-clés : sign-reversing involutions on weighted tilings
@article{10_37236_2008,
author = {Arthur T. Benjamin and Halcyon Derks and Jennifer J. Quinn},
title = {The combinatorialization of linear recurrences},
journal = {The electronic journal of combinatorics},
year = {2011},
volume = {18},
number = {2},
doi = {10.37236/2008},
zbl = {1229.05035},
url = {http://geodesic.mathdoc.fr/articles/10.37236/2008/}
}
Arthur T. Benjamin; Halcyon Derks; Jennifer J. Quinn. The combinatorialization of linear recurrences. The electronic journal of combinatorics, The Zeilberger Festschrift volume, Tome 18 (2011) no. 2. doi: 10.37236/2008
Cité par Sources :