Path counting and random matrix theory
Ioana Dumitriu, Etienne Rassart
Abstract
We establish three identities involving Dyck paths and alternating Motzkin paths, whose proofs are based on variants of the same bijection. We interpret these identities in terms of closed random walks on the halfline. We explain how these identities arise from combinatorial interpretations of certain properties of the β-Hermite and β-Laguerre ensembles of random matrix theory. We conclude by presenting two other identities obtained in the same way, for which finding combinatorial proofs is an open problem.
Create a lesson
Related papers
Elementary Proofs of Commonality of the House Graph and K4 with One Edge Subdivided
Hao Chen
Cop number of Pk-free graphs without a claw or a fork
Uttam K. Gupta, Dinabandhu Pradhan, Rashmi Rekha Swain
Connectivity keeping pendant extensions of paths in k-connected triangle-free graphs
Menghan Ma, Qinghai Liu, Liping Zhang et al.
Maximal subsets of n× n board without cycles
Giedrius Alkauskas
Sequence Factory: Families of Integer Sequences Generated by Gödel Implication
Volkan Yildiz
Avoiding a partial Latin square with an isotope of a given Latin square
Stijn Cambie, Ian M. Wanless