Redundant generating functions in lattice path enumeration

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.

This page was built for publication: Redundant generating functions in lattice path enumeration

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