Discrete Mathematics
From MaRDI portal
Publication:6356797
Abstract: The purpose of the present work is to provide short and supple teaching notes for a hours introductory course on elementary extit{Enumerative Algebraic Combinatorics}. We fully adopt the extit{Rota way}. The themes are organized into a suitable sequence that allows us to derive any result from the preceding ones by elementary processes. Definitions of extit{combinatorial coefficients} are just by their extit{combinatorial meaning}. The derivation techniques of formulae/results are founded upon constructions and two general and elementary principles/methods: - The extit{bad element} method (for extit{recursive} formulae). As the reader should recognize, the bad element method might be regarded as a combinatorial companion of the idea of extit{conditional probability}. - The extit{overcounting} principle (for extit{close form} formulae). Therefore, extit{no computation} is required in extit{proofs}: extit{computation formulae are byproducts of combinatorial constructions}. We tried to provide a self-contained presentation: the only prerequisite is standard high school mathematics. We limited ourselves to the extit{combinatorial point of view}: we invite the reader to draw the (obvious) extit{probabilistic interpretations}.
This page was built for publication: Discrete Mathematics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6356797)
