A short conceptual proof of Narayana's path-counting formula

2016/02/05 by Ciucu, Mihai
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1602.02085

Abstract

We deduce Narayana's formula for the number of lattice paths that fit in a Young diagram as a direct consequence of the Gessel-Viennot theorem on non-intersecting lattice paths.

Related

• Simple formulas for lattice paths avoiding certain periodic staircase boundaries
• Standard Young tableaux and lattice paths
• Bi-banded Paths, a Bijection and the Narayana Numbers
• Koroljuk's formula for counting lattice paths revisited
• Lattice paths in Young diagrams