English
Related papers

Related papers: Combinatorics of the double-dimer model

200 papers

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…

Combinatorics · Mathematics 2022-10-04 Helen Jenne , Gautam Webb , Benjamin Young

A conceptual framework involving partition functions of normal factor graphs is introduced, paralleling a similar recent development by Al-Bashabsheh and Mao. The partition functions of dual normal factor graphs are shown to be a Fourier…

Information Theory · Computer Science 2010-11-23 G. David Forney

We give a combinatorial proof of a result in rank 2 Donaldson-Thomas theory, which states that the generating function for certain plane-partition-like objects, called double-box configurations, is equal to a product of MacMahon's…

Combinatorics · Mathematics 2025-02-06 Tatyana Benko , Benjamin Young

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…

Combinatorics · Mathematics 2020-12-21 Helen Jenne , Gautam Webb , Benjamin Young

We study the dimer model for a planar bipartite graph N embedded in a disk, with boundary vertices on the boundary of the disk. Counting dimer configurations with specified boundary conditions gives a point in the totally nonnegative…

Combinatorics · Mathematics 2017-05-17 Thomas Lam

Partition functions, also known as homomorphism functions, form a rich family of graph invariants that contain combinatorial invariants such as the number of k-colourings or the number of independent sets of a graph and also the partition…

Computational Complexity · Computer Science 2009-05-05 Leslie Ann Goldberg , Martin Grohe , Mark Jerrum , Marc Thurley

Algebraic topology studies topological spaces with the help of tools from abstract algebra. The main focus of this paper is to show that many concepts from algebraic topology can be conveniently expressed in terms of (normal) factor graphs.…

Information Theory · Computer Science 2018-07-16 Ali Al-Bashabsheh , Pascal O. Vontobel

We find examples of duality among quantum theories that are related to arithmetic functions by identifying distinct Hamiltonians that have identical partition functions at suitably related coupling constants or temperatures. We are led to…

High Energy Physics - Theory · Physics 2010-12-17 Donald Spector

We find a close correspondence between certain partition functions of ideal quantum gases and certain symmetric polynomials. Due to this correspondence it can be shown that a number of thermodynamic identities which have recently been…

Statistical Mechanics · Physics 2009-11-07 H. -J. Schmidt , J. Schnack

We obtain a three-parameter $q$-series identity that generalizes two results of Chan and Mao. By specializing our identity, we derive new results of combinatorial significance in connection with $N(r, s, m, n)$, a function counting certain…

Combinatorics · Mathematics 2022-01-19 Atul Dixit , Ankush Goswami

We prove a family of partition identities which is "dual" to the family of Andrews-Gordon's identities. These identities are inspired by a correspondence between a special type of partitions and "hypergraphs" and their proof uses…

Commutative Algebra · Mathematics 2023-09-26 Pooneh Afsharijoo , Hussein Mourtada

The monopole-dimer model introduced recently is an exactly-solvable signed generalisation of the dimer model. We show that the partition function of the monopole-dimer model on a graph invariant under a fixed-point free involution is a…

Combinatorics · Mathematics 2020-06-16 Arvind Ayyer

We study generating functions of ordinary and plane partitions coloured by the action of a finite subgroup of the corresponding special linear group. After reviewing known results for the case of ordinary partitions, we formulate a…

Algebraic Geometry · Mathematics 2020-11-04 Ben Davison , Jared Ongaro , Balazs Szendroi

We propose and recursively prove polynomial identities which imply Capparelli's partition theorems. We also find perfect companions to the results of Andrews, and Alladi, Andrews and Gordon involving $q$-trinomial coefficients. We follow…

Number Theory · Mathematics 2019-02-18 Alexander Berkovich , Ali K. Uncu

Integrals of characteristic classes of tautological sheaves on the Hilbert scheme of points on a surface frequently arise in enumerative problems. We use the K-theoretic Donaldson-Thomas theory of certain toric Calabi-Yau threefolds to…

Algebraic Geometry · Mathematics 2021-08-12 Noah Arbesfeld

The monopole-dimer model is a signed variant of the monomer-dimer model which has determinantal structure. We extend the monopole-dimer model for planar graphs (Math. Phys. Anal. Geom., 2015) to Cartesian products thereof and show that the…

Combinatorics · Mathematics 2024-04-30 Anita Arora , Arvind Ayyer

In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…

Combinatorics · Mathematics 2016-11-01 Franck Gabriel

We define an invariant of graphs embedded in a three-manifold and a partition function for 2-complexes embedded in a triangulated four-manifold by specifying the values of variables in the Turaev-Viro and Crane-Yetter state sum models. In…

Quantum Algebra · Mathematics 2008-11-26 John W. Barrett , J. Manuel Garcia-Islas , Joao Faria Martins

We study the resurgent structure of the refined topological string partition function on a non-compact Calabi-Yau threefold, at large orders in the string coupling constant $g_s$ and fixed refinement parameter $\mathsf{b}$. For…

High Energy Physics - Theory · Physics 2024-08-07 Sergey Alexandrov , Marcos Mariño , Boris Pioline

We strengthen a result by Laskar and Lyle (Discrete Appl. Math. (2009), 330-338) by proving that it is NP-complete to decide whether a bipartite planar graph can be partitioned into three independent dominating sets. In contrast, we show…

Computational Complexity · Computer Science 2019-05-14 Juho Lauri , Christodoulos Mitillos
‹ Prev 1 2 3 10 Next ›