Compositions, Partitions, and Fibonacci Numbers
Combinatorics
2013-12-04 v1
Abstract
A bijective proof is given for the following theorem: the number of compositions of n into odd parts equals the number of compositions of n + 1 into parts greater than one. Some commentary about the history of partitions and compositions is provided.
Cite
@article{arxiv.1312.0693,
title = {Compositions, Partitions, and Fibonacci Numbers},
author = {Andrew V. Sills},
journal= {arXiv preprint arXiv:1312.0693},
year = {2013}
}