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

MaRDI QIDQ727181zbMATH OpenFDO

Authors Mihai Ciucu

Publication date 6 December 2016

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

Full work available at URL https://arxiv.org/abs/1602.02085, http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i4p11

IPFS 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)

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.

Cites work

• scientific article; zbMATH DE number 3681764 (Why is no real title available?)
• scientific article; zbMATH DE number 7731501 (Why is no real title available?)
• Binomial determinants, paths, and hook length formulae
• The Problem of the Calissons

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)