Symbolic calculus

Abstract

The notion of combinatorial class provides a deep method in order to solve a huge class of combinatorial problems: indeed we shall see a very efficient technique for calculating, by way of generating formal series, the cardinality of various sets. In particular we will concentrate on the number of sequences containing a given pattern, the number of triangulations of a convex polygon, and the number of rooted plane trees.