View Item 
        •   Utrecht University Student Theses Repository Home
        • UU Theses Repository
        • Theses
        • View Item
        •   Utrecht University Student Theses Repository Home
        • UU Theses Repository
        • Theses
        • View Item
        JavaScript is disabled for your browser. Some features of this site may not work without it.

        Browse

        All of UU Student Theses RepositoryBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

        Virtual Counts of Solid Partitions

        Thumbnail
        View/Open
        Scriptie-met-bijlages.zip (678.2Kb)
        Publication date
        2019
        Author
        Imbens, F.H.
        Metadata
        Show full item record
        Summary
        A 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.
        URI
        https://studenttheses.uu.nl/handle/20.500.12932/33649
        Collections
        • Theses
        Utrecht university logo