Redundant generating functions in lattice path enumeration

Details Redundant generating functions in lattice path enumeration Redundant generating functions in lattice path enumeration

2011-07-20

arxiv.org/abs/1107.3870v2

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Redundant generating functions in lattice path enumeration does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Redundant generating functions in lattice path enumeration, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Redundant generating functions in lattice path enumeration will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-33651