Redundant generating functions in lattice path enumeration
Combinatorics
2012-03-14 v2
Abstract
A redundant generating function is a generating function having terms which are not part of the solution of the original problem. We use redundant generating functions to study two path problems. In the first application we explain a surprising occurrence of Catalan numbers in counting paths that stay below the line y = 2x. In the second application we prove a conjecture of Niederhausen and Sullivan.
Cite
@article{arxiv.1107.3870,
title = {Redundant generating functions in lattice path enumeration},
author = {Jong Hyun Kim},
journal= {arXiv preprint arXiv:1107.3870},
year = {2012}
}