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

zbMATH Open1351.05117arXiv1602.02085MaRDI QIDQ727181FDOQ727181

Authors: Mihai Ciucu 

Publication date: 6 December 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1602.02085

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Young diagramlattice pathsNarayana's path-counting formula

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10) Enumeration in graph theory (05C30) Paths and cycles (05C38)

Cites Work

• Binomial determinants, paths, and hook length formulae
• Title not available (Why is that?)
• The Problem of the Calissons
• Title not available (Why is that?)

This page was built for publication: A short conceptual proof of Narayana's path-counting formula

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q727181)