Abstract

this paper for two problems concerning the enumeration of trees and ballot sequences, in which the above -- mentioned conditions, which finally yield the Catalan and generalized Catalan numbers, are slightly modified. We want to count trees, in which every vertex has at most s successors and ballot sequences, which fulfill the condition 1 wt(x 1 ; : : : ; x i )

Description

citeulike

Links and resources

Tags