Book Description

The main goal of our book is to provide easy access to the basic principles and methods that combinatorial calculations are based upon. The rule of product, the identity principle, recurrence relations and inclusion-exclusion principle are the most important of the above. Significant parts of the book are devoted to classical combinatorial structures, such as: ordering (permutations), tuples, and subsets (combinations). A great deal of attention is paid to the properties of binomial coefficients, and in particular, to model proofs of combinatorial identities. Problems concerning some exact combinatorial configurations such as paths in a square, polygonal chains constructed with chords of a circle, trees (undirected graphs with no cycles) etc. are included too. All chapters contain a considerable number of exercises of various complexity, from easy training tasks to complex problems which require decent persistence and skill from the one who dares to solve them. If one aims to passively familiarise oneself with the subject, methods and the most necessary facts of combinatorics, then it may suffice to limit one's study to the main text omitting the exercise part of the book. However, for those who want to immerse themselves in combinatorial problems and to gain skills of active research in that field, the exercise section is rather important. The authors hope that the book will be helpful for several categories of readers. University teachers and professors of mathematics may find somewhat unusual coverage of certain matters and exercises which can be readily applied in their professional work. We believe that certain series of problems may serve as a base for serious creative works and essays. This especially refers to students at pedagogical universities and colleges who need to prepare themselves to the teaching of the basics of combinatorics, mainly building on arithmetic and geometry. Most of the exercises of the book are of this very origin.