Abstract
Recently, Kenyon and Wilson introduced a certain matrix M in order to compute pairing probabilities of what they call the double-dimer model. They showed that the absolute value of each entry of the inverse matrix M -11 is equal to the number of certain Dyck tilings of a skew shape. They conjectured two formulas on the sum of the absolute values of the entries in a row or a column of M -11. In this paper we prove the two conjectures. As a consequence we obtain that the sum of the absolute values of all entries of M -1 is equal to the number of complete matchings. We also find a bijection between Dyck tilings and complete matchings.
| Original language | English |
|---|---|
| Pages (from-to) | 1692-1710 |
| Number of pages | 19 |
| Journal | Journal of Combinatorial Theory. Series A |
| Volume | 119 |
| Issue number | 8 |
| DOIs | |
| State | Published - Nov 2012 |
| Externally published | Yes |
Keywords
- Dyck paths
- Dyck tilings
- Hermite histories
- Hermite polynomials
- Matchings
Fingerprint
Dive into the research topics of 'Proofs of two conjectures of Kenyon and Wilson on Dyck tilings'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver