The combinatorial PT-DT correspondence
From MaRDI portal
Publication:2680971
Abstract: We resolve an open conjecture from algebraic geometry, which states that two generating functions for plane partition-like objects (the "box-counting" formulae for the Calabi-Yau topological vertices in Donaldson-Thomas theory and Pandharipande-Thomas theory) are equal up to a factor of MacMahon's generating function for plane partitions. The main tools in our proof are a Desnanot-Jacobi-type "condensation" identity, and a novel application of the tripartite double-dimer model of Kenyon-Wilson.
Recommendations
Cites work
- scientific article; zbMATH DE number 5050088 (Why is no real title available?)
- Applications of graphical condensation for enumerating matchings and tilings
- Combinatorics of the double-dimer model
- Curves on K 3 surfaces and modular forms
- Gromov-Witten/Donaldson-Thomas correspondence for toric 3-folds
- Gromov–Witten theory and Donaldson–Thomas theory, I
- Gromov–Witten theory and Donaldson–Thomas theory, II
- Rank 2 sheaves on toric 3-folds: classical and virtual counts
- The 3-fold vertex via stable pairs
- The combinatorial PT-DT correspondence
Cited in
(10)- Residue theorem for rational trigonometric sums and Verlinde's formula
- The complex side of the TS/ST correspondence
- Squishing dimers on the hexagon lattice
- Miura operators, degenerate fields and the M2-M5 intersection
- A Gaussian distribution for refined DT invariants and 3D partitions
- Geometry and combinatorics of crystal melting
- Enumerating coloured partitions in 2 and 3 dimensions
- The combinatorial PT-DT correspondence
- Combinatorics of the double-dimer model
- The 4-fold Pandharipande-Thomas vertex
This page was built for publication: The combinatorial PT-DT correspondence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2680971)