Sciweavers

DM
1999
79views more  DM 1999»
13 years 4 months ago
A bijective proof of Riordan's theorem on powers of Fibonacci numbers
Let Fk(x) = n=0 Fk n xn . Using the interpretation of Fibonacci numbers in the terms of Morse codes, we give a bijective proof of Riordan's formula (1 - Lkx + (-1)k x2 )Fk(x...
Andrej Dujella
EJC
2006
13 years 5 months ago
An iterative-bijective approach to generalizations of Schur's theorem
Abstract. We start with a bijective proof of Schur's theorem due to Alladi and Gordon and describe how a particular iteration of it leads to some very general theorems on colo...
Sylvie Corteel, Jeremy Lovejoy
DM
2008
88views more  DM 2008»
13 years 5 months ago
Bijective proofs of Gould's and Rothe's identities
We first give a bijective proof of Gould's identity in the model of binary words. Then we deduce Rothe's identity from Gould's identity again by a bijection, which a...
Victor J. W. Guo