Abstract
In Chapter 12 we studied some interesting applications of the Pell family to combinatorics, in particular, to the theory of lattice-walking. This chapter presents additional applications to combinatorics, including the theory of partitioning.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Currently at the University of Florida at Gainesville.
References
K. Alladi and V.E. Hoggatt, Jr., Compositions with Ones and Twos, Fibonacci Quarterly 12 (1974), 233–239.
A.T. Benjamin and J.J. Quinn, Proofs That Really Count: The Art of Combinatorial Proof, MAA, Washington, D.C., 2003.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer Science+Business Media New York
About this chapter
Cite this chapter
Koshy, T. (2014). Pell Tilings. In: Pell and Pell–Lucas Numbers with Applications. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8489-9_16
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8489-9_16
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8488-2
Online ISBN: 978-1-4614-8489-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)