Combinatorics of Tripartite Boundary Connections for Trees and Dimers (2008)
Kenyon, Richard W., Wilson, David B.
A grove is a spanning forest of a planar graph in which every component tree contains at least one of a special subset of vertices on the outer face called nodes. For the natural probability measure...
Boundary Partitions in Trees and Dimers (2006)
Kenyon, Richard W., Wilson, David B.
Given a finite planar graph, a grove is a spanning forest in which every component tree contains one or more of a specified set of vertices (called nodes) on the outer face. For the uniform measure...
Richard W. Kenyon, David B. Wilson
We study the phase transition in the honeycomb dimer model (equivalently, monotone non-intersecting lattice path model). At the critical point the system has a strong long-range dependence; in...
Critical resonance in the non-intersecting lattice path model (2001)
Kenyon, Richard W., Wilson, David B.
We study the phase transition in the honeycomb dimer model (equivalently, monotone non-intersecting lattice path model). At the critical point the system has a strong long-range dependence; in...
Richard W. Kenyon, David B. Wilson
In this article, Temperley’s bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on the other, is extended...
Kenyon, Richard W., Propp, James G., Wilson, David B.
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on the other, is extended to...
Richard W. Kenyon, James G. Propp, David B. Wilson
In this article, Temperley's bijection between spanning trees in the square grid and perfect matchings (also known as dimer coverings) of the square grid is generalized to the setting of general...
Richard W. Kenyon, James G. Propp, David B. Wilson
In this article, Temperley's bijection between spanning trees in the square grid and perfect matchings (also known as dimer coverings) of the square grid is generalized to the setting of general...
Richard W. Kenyon, James G. Propp, David B. Wilson
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on the other, is...
Richard W. Kenyon, James G. Propp, David B. Wilson
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on the other, is...