Double-dimer pairings and skew Young diagrams (Q547790): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Importer (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: David Bruce Wilson / rank
Normal rank
 
Property / author
 
Property / author: David Bruce Wilson / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1007.2006 / rank
 
Normal rank

Latest revision as of 15:10, 18 April 2024

scientific article
Language Label Description Also known as
English
Double-dimer pairings and skew Young diagrams
scientific article

    Statements

    Double-dimer pairings and skew Young diagrams (English)
    0 references
    0 references
    0 references
    24 June 2011
    0 references
    Summary: We study the number of tilings of skew Young diagrams by ribbon tiles shaped like Dyck paths, in which the tiles are ``vertically decreasing''. We use these quantities to compute pairing probabilities in the double-dimer model: Given a planar bipartite graph \(G\) with special vertices, called nodes, on the outer face, the doubledimer model is formed by the superposition of a uniformly random dimer configuration (perfect matching) of \(G\) together with a random dimer configuration of the graph formed from \(G\) by deleting the nodes. The double-dimer configuration consists of loops, doubled edges, and chains that start and end at the boundary nodes. We are interested in how the chains connect the nodes. An interesting special case is when the graph is \(\varepsilon (\mathbb Z \times \mathbb N)\) and the nodes are at evenly spaced locations on the boundary \(\mathbb R\) as the grid spacing \(\varepsilon \rightarrow 0\).
    0 references
    skew Young diagram
    0 references
    double-dimer model
    0 references
    grove
    0 references
    spanning tree
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references