In my research on the theory of partitions and related questions, I have often used recurrent integer sequences such as the Fibonacci numbers to obtain hints about the behavior of certain partition generating functions. In this article, I will illustrate this process by studying the relationship between the Fibonacci numbers and a sequence of polynomials used by Schur in his second proof of the Rogers-Ramanujan identities. I will try to make clear how generating function proofs of Fibonacci identities lead to analogous results for Schur's polynomials. We shall find that this approach helps explain why the generalization of Fibonacci formulas to Schur's polynomial is sometimes rather intricate.
|Original language||English (US)|
|Number of pages||17|
|State||Published - Feb 1 2004|
All Science Journal Classification (ASJC) codes
- Algebra and Number Theory