Linear recurrences through tilings and Markov chains

Authors

  • Benjamin, Arthur T.
  • Hanusa, Christopher R.H.
  • Edward Su, Francis

Abstract

We present a tiling interpretation for k-th order linear recurrences, which yields new combinatorial proofs for recurrence identities. Moreover, viewing the tiling process as a Markov chain also yields closed form Binet-like expressions for these recurrences.

Published

2003-06-09

How to Cite

Benjamin, Arthur T., Hanusa, Christopher R.H., & Edward Su, Francis. (2003). Linear recurrences through tilings and Markov chains. Utilitas Mathematica, 64. Retrieved from http://utilitasmathematica.com/index.php/Index/article/view/288

Issue

Vol. 64 (2003): Volume 64, 2003

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.