by S. E. Payne
Publisher: University of Colorado 2003
Number of pages: 216
The course at CU-Denver for which these notes were assembled, Math 6409 (Applied Combinatorics), deals more or less entirely with enumerative combinatorics. We have tried to include some truly traditional material and some truly nontrivial material, albeit with a treatment that makes it accessible to the student. We shall derive a variety of techniques for counting, some purely combinatorial, some involving algebra in a moderately sophisticated way.
This document is no more available for free.
by Mitchel T. Keller, William T. Trotter - Georgia Institute of Technology
The purpose of the course is to give students a broad exposure to combinatorial mathematics, using applications to emphasize fundamental concepts and techniques. Our approach to the course is to show students the beauty of combinatorics.
by Peter J. Cameron - Queen Mary, University of London
Contents: Subsets and binomial coefficients; Selections and arrangements; Power series; Recurrence relations; Partitions and permutations; The Principle of Inclusion and Exclusion; Families of sets; Systems of distinct representatives; etc.
by Edward A. Bender, S. Gill Williamson - Dover Publications
This introduction to combinatorics, the interaction between computer science and mathematics, is suitable for upper-level undergraduates and graduate students in engineering, science, and mathematics. Some ability to construct proofs is assumed.
by Dainis Zeps - Latvian University
Contents: Permutations; Combinatorial maps; The correspondence between combinatorial maps and graphs on surfaces; Map's mirror reflection and dual map; Multiplication of combinatorial maps; Normalized combinatorial maps; Geometrical interpretation...