Recursively defined combinatorial functions:

ABSTRACT


We will study recursively defined functions of the type Our results are, however, more general. They also allow decomposition of certain Galton schemata into matrix products of simpler structures. Somewhat surprisingly, the proof techniques are mainly applications of elementary linear algebra methods. 
Combinatorics Seminar, Mathematics Department, MIT, sara(atsign)math.mit.edu 

