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

zbMath1351.05117arXiv1602.02085MaRDI QIDQ727181

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

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
• The Problem of the Calissons
• Unnamed Item
• Unnamed Item

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