On Some n-Color Composition
| dc.contributor.author | Ratta, Shelja | |
| dc.contributor.supervisor | Rana, Meenakshi | |
| dc.date.accessioned | 2014-09-13T10:40:50Z | |
| dc.date.available | 2014-09-13T10:40:50Z | |
| dc.date.issued | 2014-09-13T10:40:50Z | |
| dc.description | MS, SMCA | en |
| dc.description.abstract | In this thesis, we studied ordered partitions, called compositions which were first defined by MacMahon, ``P.A MacMahon, Combinatory Analysis, AMS Chelsea Publishing, 2001." Chapter 1 is devoted to basic definitions and preliminary results on classical partitions, compositions and Fibonacci numbers. Chapter 2 discuss the generating functions of n-Color Compositions and some recurrence formulas related to compositions. In Chapter 3, we have studied an identity analouges to Euler's partition identity and some new combinatorial properties of n-color compositions. | en |
| dc.format.extent | 2054383 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/10266/3201 | |
| dc.language.iso | en | en |
| dc.subject | Combinatorial Identities, Colored Partitions, Compositions | en |
| dc.title | On Some n-Color Composition | en |
| dc.type | Thesis | en |