Independent GUE minor processes of perfect matchings on rail-yard graphs

Independent GUE minor processes of perfect matchings on rail-yard graphs
Notice: This research summary and analysis were automatically generated using AI technology. For absolute accuracy, please refer to the [Original Paper Viewer] below or the Original ArXiv Source.

We study perfect matchings on the rail-yard graphs in which the right boundary condition is given by the empty partition and the left boundary can be divided into finitely many alternating line segments where all the vertices along each line segment are either removed or remained. When the edge weights satisfy certain conditions, we show that the distributions of the locations of certain types of dimers near the right boundary converge to the spectra of independent GUE minor processes. The proof is based on new quantitative analysis of a formula to compute Schur functions at general points discovered in \cite{ZL18}.


💡 Research Summary

The paper investigates dimer (perfect matching) configurations on a broad class of planar graphs called rail‑yard graphs (RYGs). An RYG is specified by an integer interval


Comments & Academic Discussion

Loading comments...

Leave a Comment