• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 3
  • Tagged with
  • 3
  • 3
  • 3
  • 3
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Counting coloured boxes

Young, Benjamin 05 1900 (has links)
This thesis consists of the manuscripts of two research papers. In the first paper, we verify a recent conjecture of Kenyon/Szendroi by computing the generating function for pyramid partitions. Pyramid partitions are closely related to Aztec Diamonds; their generating function turns out to be the partition function for the Donaldson-Thomas theory of a non-commutative resolution of the conifold singularity {x₁‚x₂‚‚ - x₃‚ƒx₄‚„ = 0}⊂ C⁴. The proof does not require algebraic geometry; it uses a modified version of the domino (or dimer) shuffling algorithm of Elkies, Kuperberg, Larsen and Propp. In the second paper, we derive two multivariate generating functions for three-dimensional Young diagrams (also called plane partitions). The variables correspond to a colouring of the boxes according to a finite abelian subgroup G of SO(3). These generating functions turn out to be orbifold Donaldson-Thomas partition functions for the orbifold [C³/G]. We need only the vertex operator methods of Okounkov-Reshetikhin-Vafa for the easy case G = Zn; to handle the considerably more difficult case G = Z₂‚‚ x Z₂‚‚, we will also use a refinement of the author's recent q-enumeration of pyramid partitions. In the appendix, written by Jim Bryan, we relate the diagram generating functions to the Donaldson-Thomas partition functions of the orbifold [C³/G]. We find a relationship between the Donaldson-Thomas partition functions of the orbifold and its G-Hilbert scheme resolution. We formulate a crepant resolution conjecture for the Donaldson-Thomas theory of local orbifolds satisfying the Hard Lefschetz condition.
2

Counting coloured boxes

Young, Benjamin 05 1900 (has links)
This thesis consists of the manuscripts of two research papers. In the first paper, we verify a recent conjecture of Kenyon/Szendroi by computing the generating function for pyramid partitions. Pyramid partitions are closely related to Aztec Diamonds; their generating function turns out to be the partition function for the Donaldson-Thomas theory of a non-commutative resolution of the conifold singularity {x₁‚x₂‚‚ - x₃‚ƒx₄‚„ = 0}⊂ C⁴. The proof does not require algebraic geometry; it uses a modified version of the domino (or dimer) shuffling algorithm of Elkies, Kuperberg, Larsen and Propp. In the second paper, we derive two multivariate generating functions for three-dimensional Young diagrams (also called plane partitions). The variables correspond to a colouring of the boxes according to a finite abelian subgroup G of SO(3). These generating functions turn out to be orbifold Donaldson-Thomas partition functions for the orbifold [C³/G]. We need only the vertex operator methods of Okounkov-Reshetikhin-Vafa for the easy case G = Zn; to handle the considerably more difficult case G = Z₂‚‚ x Z₂‚‚, we will also use a refinement of the author's recent q-enumeration of pyramid partitions. In the appendix, written by Jim Bryan, we relate the diagram generating functions to the Donaldson-Thomas partition functions of the orbifold [C³/G]. We find a relationship between the Donaldson-Thomas partition functions of the orbifold and its G-Hilbert scheme resolution. We formulate a crepant resolution conjecture for the Donaldson-Thomas theory of local orbifolds satisfying the Hard Lefschetz condition.
3

Counting coloured boxes

Young, Benjamin 05 1900 (has links)
This thesis consists of the manuscripts of two research papers. In the first paper, we verify a recent conjecture of Kenyon/Szendroi by computing the generating function for pyramid partitions. Pyramid partitions are closely related to Aztec Diamonds; their generating function turns out to be the partition function for the Donaldson-Thomas theory of a non-commutative resolution of the conifold singularity {x₁ x₂ - x₃ x₄ = 0}⊂ C⁴. The proof does not require algebraic geometry; it uses a modified version of the domino (or dimer) shuffling algorithm of Elkies, Kuperberg, Larsen and Propp. In the second paper, we derive two multivariate generating functions for three-dimensional Young diagrams (also called plane partitions). The variables correspond to a colouring of the boxes according to a finite abelian subgroup G of SO(3). These generating functions turn out to be orbifold Donaldson-Thomas partition functions for the orbifold [C³/G]. We need only the vertex operator methods of Okounkov-Reshetikhin-Vafa for the easy case G = Zn; to handle the considerably more difficult case G = Z₂ x Z₂ , we will also use a refinement of the author's recent q-enumeration of pyramid partitions. In the appendix, written by Jim Bryan, we relate the diagram generating functions to the Donaldson-Thomas partition functions of the orbifold [C³/G]. We find a relationship between the Donaldson-Thomas partition functions of the orbifold and its G-Hilbert scheme resolution. We formulate a crepant resolution conjecture for the Donaldson-Thomas theory of local orbifolds satisfying the Hard Lefschetz condition. / Science, Faculty of / Mathematics, Department of / Graduate

Page generated in 0.0575 seconds