Proofs of two conjectures of Kenyon and Wilson on Dyck tilings

@article{Kim2012ProofsOT,
  title={Proofs of two conjectures of Kenyon and Wilson on Dyck tilings},
  author={Jang Soo Kim},
  journal={J. Comb. Theory, Ser. A},
  year={2012},
  volume={119},
  pages={1692-1710}
}
  • J. Kim
  • Published 29 August 2011
  • Mathematics
  • J. Comb. Theory, Ser. A
Generalized Dyck tilings
Generalized Dyck tilings (Extended Abstract)
Recently, Kenyon and Wilson introduced Dyck tilings, which are certain tilings of the region between two Dyck paths. The enumeration of Dyck tilings is related with hook formulas for forests and the
Dyck tilings, linear extensions, descents, and inversions
Dyck tilings were introduced by Kenyon and Wilson in their study of double-dimer pairings. They are certain kinds of tilings of skew Young diagrams with ribbon tiles shaped like Dyck paths. We give
Ballot tilings and increasing trees
We study enumerations of Dyck and ballot tilings, which are tilings of a region determined by two Dyck or ballot paths. We give bijective proofs to two formulae of enumerations of Dyck tilings
Dyck tilings and the homogeneous Garnir relations for graded Specht modules
Suppose $$\lambda $$λ and $$\mu $$μ are integer partitions with $$\lambda \supseteq \mu $$λ⊇μ. Kenyon and Wilson have introduced the notion of a cover-inclusive Dyck tiling of the skew Young diagram
Dyck tilings, increasing trees, descents, and inversions
Dyck tilings, linear extensions, descents, and inversions (extended abstract)
Dyck tilings were introduced by Kenyon and Wilson in their study of double-dimer pairings. They are certain kinds of tilings of skew Young diagrams with ribbon tiles shaped like Dyck paths. We give
Rational Dyck tilings
We introduce rational Dyck tilings, or (a, b)-Dyck tilings, and study them by the decomposition into (1, 1)-Dyck tilings. This decomposition allows us to make use of combinatorial models for (1,
Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on Z^2
We show how to compute the probabilities of various connection topologies for uniformly random spanning trees on graphs embedded in surfaces. As an application, we show how to compute the "intensity"
Fully Packed Loops in a triangle: Matchings, paths and puzzles
...
...

References

SHOWING 1-10 OF 37 REFERENCES
Dyck tilings, linear extensions, descents, and inversions
Dyck tilings were introduced by Kenyon and Wilson in their study of double-dimer pairings. They are certain kinds of tilings of skew Young diagrams with ribbon tiles shaped like Dyck paths. We give
Touchard–Riordan formulas, T-fractions, and Jacobi’s triple product identity
Touchard–Riordan-like formulas are certain expressions appearing in enumeration problems and as moments of orthogonal polynomials. We begin this article with a new combinatorial approach to prove
Distribution of Crossings, Nestings and Alignments of Two Edges in Matchings and Partitions
TLDR
The symmetric distribution of the numbers of crossings and nestings in partitions is derived, which generalizes a recent result of Klazar and Noy in perfect matchings by factorizing the involution through bijections between set partitions and some path diagrams.
Double-Dimer Pairings and Skew Young Diagrams
TLDR
The number of tilings of skew Young diagrams by ribbon tiles shaped like Dyck paths, in which the tiles are "vertically decreasing", is studied to compute pairing probabilities in the double-dimer model.
Boundary Partitions in Trees and Dimers
TLDR
The double-dimer connection probabilities coincide with those of the contour lines in the Gaussian free field with certain natural boundary conditions, and have direct application to connection probabilities for multiple-strand SLE2, SLE8, and SLE4.
Kazhdan-Lusztig and R-polynomials, Young's lattice, and Dyck partitions
We give explicit combinatorial product formulas for the maximal parabolic Kazhdan-Lusztig and R-polynomials of the symmetric group. These formulas imply that these polynomials are combinatorial
On Touchard's continued fraction and extensions: combinatorics-free, self-contained proofs
Abstract We give a direct and simple proof of Touchard's continued fraction, provide an extension of it, and transform it into similar expansions related to Motzkin and Schröder numbers. Another
A Refinement of Cayley's Formula for Trees
TLDR
The approach gives a new proof of Du and Liu's results and gives new hook length formulas, and a interpretation of the polynomials P_n(a,b,c) in terms of parking functions: the authors count parking functions according to the number of cars that park in their preferred parking spaces.
What Is Enumerative Combinatorics
The basic problem of enumerative combinatorics is that of counting the number of elements of a finite set. Usually are given an infinite class of finite sets S i where i ranges over some index set I
...
...