Building a Better Bijection between Classes of CompositionsIntegers
AbstractA bijective proof is given for the following theorem: The number of compositions of n into parts congruent to a (mod b) equals the number of compositions of n + b - a into parts congruent to b (mod a) that are greater than or equal to b. The bijection is then shown to preserve palindromicity.
Citation InformationJames D. Diffenderfer. "Building a Better Bijection between Classes of Compositions" Integers Vol. 14 (2014) p. A44
Available at: http://works.bepress.com/james_diffenderfer/20/