Combinatorics and Number Theory of Counting Sequences by István Mező (Discrete Mathematics and Its Applications)
Requirements: .PDF reader, 4 mb
Overview: Combinatorics and Number Theory of Counting Sequences is an introduction to the theory of finite set partitions and to the enumeration of cycle decompositions of permutations.
The presentation prioritizes elementary enumerative proofs. Therefore, parts of the book are designed so that even those high school students and teachers who are interested in combinatorics can have the benefit of them. Still, the book collects vast, up-to-date information for many counting sequences (especially, related to set partitions and permutations), so it is a must-have piece for those mathematicians who do research on enumerative combinatorics.
In addition, the book contains number theoretical results on counting sequences of set partitions and permutations, so number theorists who would like to see nice applications of their area of interest in combinatorics will enjoy the book, too.
Genre: Non-Fiction > Educational
Download Instructions:
http://gestyy.com/w51gM6
http://gestyy.com/w51g1y
