scientific article; zbMATH DE number 17051
[For the entire collection see Zbl 0722.00014.] In order to introduce the use of generating functions in the solution of difference equations, the author first considers two problems leading to linear difference equations. These are the determination of in how many sequences of 0's and 1's of length \(n\) a certain pattern occurs in the \(n\)-th place at all, and for the first time. The other examples lead to equations which are properly nonlinear in character. If \(a_ n\) denotes the number of binary trees on \(n\) nodes, then the generating function satisfies \(A(x) - 1 = x(A(x))^ 2\), and the \(a_ n\) are Catalan numbers. Two more situations leading to the Catalan numbers are analyzed. One is to determine the number of ways of distributing parentheses in a sum \(w_ 1 + w_ 2 + \cdots + w_ n\). The last is to find the number of possible output sequences from an input sequence of \(n\) objects, in a last-in-first-out system.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3973746)