Paths, Permutations and Trees: from Fibonacci to Catalan

 

Elena Barcucci

Dipartimento di Sistemi e Informatica, Università di Firenze, Via Lombroso 6/17, 50134 Firenze, Italy  

barcucci@dsi.unifi.it

 

Abstract.      Full Text PDF

 

Permutations with forbidden subsequences constitute well known

The results obtained for permutations are then extended to lattice paths and rooted trees. In this case the constraints on the subsequences become constraints on the height of the paths and their valleys and on the outdegree of the nodes in the trees, respectively.