A Bijection between Two Classes of Restricted CompositionsGSU Discrete Math Seminar (2012)
AbstractTwo 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.
Publication DateApril, 2012
Citation InformationJames D. Diffenderfer. "A Bijection between Two Classes of Restricted Compositions" GSU Discrete Math Seminar (2012)
Available at: http://works.bepress.com/james_diffenderfer/7/