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.
Symbolic calculus
Mariconda C.;Tonolo A.
2016
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.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
Ch11.pdf
Accesso riservato
Tipologia:
Published (Publisher's Version of Record)
Licenza:
Accesso privato - non pubblico
Dimensione
797.4 kB
Formato
Adobe PDF
|
797.4 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
