Show simple item record

dc.rights.licenseCC-BY-NC-ND
dc.contributor.advisorKool, M.
dc.contributor.authorImbens, F.H.
dc.date.accessioned2019-08-26T17:01:11Z
dc.date.available2019-08-26T17:01:11Z
dc.date.issued2019
dc.identifier.urihttps://studenttheses.uu.nl/handle/20.500.12932/33649
dc.description.abstractA partition is a finite descending sequence of non negative integers. This concept can be extended to multiple dimensions to form planar and solid partitions. For standard, or line, partitions there is an infinite product formula for the generating function by Euler which gives the number of partitions of a certain size. MacMahon found such a formula for planar partitions. However his conjecture for such an infinite product formula for solid partitions was incorrect for size 6 and up. In this thesis I will look at a conjecture made in an article by Y. Cao and M. Kool, giving a weighted generating function for solid partitions and verify it in many new cases.
dc.description.sponsorshipUtrecht University
dc.format.extent702428
dc.format.extent115449
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/x-c++
dc.language.isoen
dc.titleVirtual Counts of Solid Partitions
dc.type.contentBachelor Thesis
dc.rights.accessrightsOpen Access
dc.subject.courseuuWiskunde


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record