“…Note: If P i,n represents the polynomial sequence for identity 3.i for i = 8, 12, 13, then P 13,n = P 12,n−1 + P 8,n−1 + q n−1 P 12,n−2 . j≧0 k≧0 The proof also appears in Santos [61]. j≧0 k≧0…”
Section: Identitiesmentioning
confidence: 78%
“…Further examples of recurrence proofs may be found elsewhere in the literature: Santos [60, Chapter 2] contains proofs of Identities 3.29 and 3.38-b. Santos proves Identity 3.20 in [61]. Proofs of Identities 3.8 and 3.12 are given in Santos and Sills [62, Theorems 1 and 3].…”
Polynomial generalizations of all 130 of the identities in Slater's list of identities of the Rogers-Ramanujan type are presented. Furthermore, duality relationships among many of the identities are derived. Some of the these polynomial identities were previously known but many are new.
“…Note: If P i,n represents the polynomial sequence for identity 3.i for i = 8, 12, 13, then P 13,n = P 12,n−1 + P 8,n−1 + q n−1 P 12,n−2 . j≧0 k≧0 The proof also appears in Santos [61]. j≧0 k≧0…”
Section: Identitiesmentioning
confidence: 78%
“…Further examples of recurrence proofs may be found elsewhere in the literature: Santos [60, Chapter 2] contains proofs of Identities 3.29 and 3.38-b. Santos proves Identity 3.20 in [61]. Proofs of Identities 3.8 and 3.12 are given in Santos and Sills [62, Theorems 1 and 3].…”
Polynomial generalizations of all 130 of the identities in Slater's list of identities of the Rogers-Ramanujan type are presented. Furthermore, duality relationships among many of the identities are derived. Some of the these polynomial identities were previously known but many are new.
“…We use a method introduced by Andrews [5], and used by Santos [9] to obtain finite versions of Rogers-Ramanujan type identities. Basic tools are presented in the following section.…”
Section: Or In Terms Of Partitions One Interpretation Obtained By Thmentioning
Abstract. We present interesting combinatorial interpretations for the Fibonacci numbers in terms of colored partitions obtained by using finite versions of two identities of the Rogers-Ramanujan type. New formula for the Fibonacci numbers is also given.
“…Santos em [8], provou uma fórmula explícita para a família de polinômios P k n para o caso k = 0. Para o caso k = 1, temos a seguinte conjecturada dada em [9]:…”
Section: Uma Fórmula Explícita Para Os Números De Fibonacciunclassified
“…Observamos que as partições Frobenius de alternânciaímpar com maior parte igual a N +1 são geradas por f 16 (q, t) e são um caso particular das partições autoconjugadas Frobenius de alternânciaímpar, caso k sejaímpar (par), com maior parte N + k e o elemento do topo ≥ k, quando fazemos k = 1. O caso k = 0, do Teorema (3.1) fornece um resultado ja obtido por Santos em [8].…”
Resumo. Neste trabalho, damos uma nova interpretação combinatória para os números de Fibonacci em termos de partições restritas, fazendo uso do Símbolo de Frobenius. Também damos uma demonstração de uma conjectura para uma fórmula explícita de uma família de polinômios dada por Santos em [9].
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.