Skip to main content
Article
A Bijection between Two Classes of Restricted Compositions
Fibonacci Quarter
  • James D. Diffenderfer
Document Type
Article
Publication Date
1-1-2012
Disciplines
Abstract

Two proofs, one using generating functions, the other bijective, are given for the following theorem: The number of compositions of n into parts congruent to 1 (mod k) equals the number of compositions of n + k − 1 into parts greater than k − 1. This bijection is then proven to hold for palindromic compositions. A more general theorem is presented in conclusion.

Citation Information
James D. Diffenderfer. "A Bijection between Two Classes of Restricted Compositions" Fibonacci Quarter Vol. 50 Iss. 4 (2012) p. 360 - 365
Available at: http://works.bepress.com/james_diffenderfer/13/