Compositions, Bijections, and Enumerations

<p>In this thesis we give an introduction to colored-compositions of an integer. This is a generalization of traditional integer compositions, and we show a few results for n-color compositions which are analogous to regular compositions with both combinatorial and analytic proofs. We also show several bijections between various types of compositions to certain types of numeric strings, and provide a generalization of a classic bijection between compositions and binary strings.</p>

Name thesis:degree_name

Master of Science in Mathematics (M.S.)

Level thesis:degree_level

Thesis (open access)

Discipline thesis:degree_discipline

Department of Mathematical Sciences

Year dc:date.available

2012

Author dc:creator

• Dedrickson, Charles R., III

Contributors dc:contributor

• Andrew Sills
• David Stone

• ETD
• Color compositions
• Bijection
• Generating function
• N-colored
• Mathematics

Repository record dc:identifier

https://digitalcommons.georgiasouthern.edu/etd/17

OAI identifier oai:identifier

oai:digitalcommons.georgiasouthern.edu:etd-1015