On n- color Partitions and Combinatorics.

dc.contributor.authorPriyanka
dc.contributor.supervisorRana, Meenakshi
dc.date.accessioned2016-07-29T11:32:06Z
dc.date.available2016-07-29T11:32:06Z
dc.date.issued2016-07-29
dc.departmentMathematicsENG
dc.descriptionM.Sc(Mathematics and Computing) Thesis.en_US
dc.description.abstractThe present dissertation contains a detail study of investigations carried out by various authors on enumerative combinatorics using n-color partitions of certain q-series. The whole work is divided into three chapters. Chapter 1 is introductory including elementary definitions, notations and generating functions which will be required for later chapters. This chapter includes some celebrated identities such as Rogers-Ramanujan Identities and Gollnitz-Gordan Identities. In Chapter 2, we have discussed n-color partitions introduced by Agarwal and Andrews ["N copies of N", J. Combin. Theory Ser. A 45, (1987), 40-49]. This chapter is further devoted to the study of (n + t)-color partitions. In Chapter 3, we have done the survey of further advances in n-color partitions. It particularly include the combinatorial interpretations of q-series using n-color partitions, further Rogers-Ramanujan type Identities for n-color partitions are also explored.en_US
dc.identifier.urihttp://hdl.handle.net/10266/3970
dc.language.isoenen_US
dc.subjectcolored partitionsen_US
dc.subjectcombinatoricsen_US
dc.titleOn n- color Partitions and Combinatorics.en_US
dc.typeThesisen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
3970.pdf
Size:
373.82 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
2.03 KB
Format:
Item-specific license agreed upon to submission
Description: