activity
20192021
most citedCombinatorics of the double-dimer model

11 citations · 15 across the 5 of their papers we have counts for

collaborators

5 papers

math.CO2021

Lattice walks confined to an octant in dimension 3: (non-)rationality of the second critical exponent

Luc Hillairet, Helen Jenne, Kilian Raschel

In the field of enumeration of walks in cones, it is known how to compute asymptotically the number of excursions (finite paths in the cone with fixed length, starting and ending p…

math.CO2021

Double-dimer condensation and the PT-DT correspondence

Helen Jenne, Gautam Webb, 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 t…

math.CO2020★ 3 cited

The combinatorial PT-DT correspondence

Helen Jenne, Gautam Webb, 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 t…

math.CO2019★ 11 cited

Combinatorics of the double-dimer model

Helen Jenne

We prove that the partition function for tripartite double-dimer configurations of a planar bipartite graph satisfies a recurrence related to the Desnanot-Jacobi identity from line…

math.CO2019★ 1 cited

Matching complexes of trees and applications of the matching tree algorithm

Marija Jelić Milutinović, Helen Jenne, Alex McDonough +1

A matching complex of a simple graph is a simplicial complex with faces given by the matchings of . The topology of matching complexes is mysterious; there are few graphs fo…