Article ID Journal Published Year Pages File Type
1708528 Applied Mathematics Letters 2012 6 Pages PDF
Abstract

In this paper, we describe the uplift principle for ordered trees which lets us solve a variety of combinatorial problems in two simple steps. The first step is to find the appropriate generating function at the root of the tree, the second is to lift the result to an arbitrary vertex by multiplying by the leaf generating function. This paper, though self contained, is a companion piece to Cheon and Shapiro (2008) [2] though with many more possible applications. It also may be viewed as an invitation, via the symbolic method, to the authoritative 800 page book of Flajolet and Sedgewick (2009) [8]. Our examples, with one exception, are different from those in this excellent reference.

Related Topics
Physical Sciences and Engineering Engineering Computational Mechanics
Authors
, ,