Combinatorics and Number Theory of Counting Sequences

1st Edition

Istvan Mezo

Chapman and Hall/CRC
Published August 20, 2019
Reference - 480 Pages - 10 B/W Illustrations
ISBN 9781138564855 - CAT# K43571
Series: Discrete Mathematics and Its Applications

For Instructors Request Inspection Copy

USD$119.95

Add to Wish List
FREE Standard Shipping!

Summary

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.

Features

  • The Outlook sections at the end of each chapter guide the reader towards topics not covered in the book, and many of the Outlook items point towards new research problems.
  • An extensive bibliography and tables at the end make the book usable as a standard reference.
  • Citations to results which were scattered in the literature now become easy, because huge parts of the book (especially in parts II and III) appear in book form for the first time.

Instructors

We provide complimentary e-inspection copies of primary textbooks to instructors considering our books for course adoption.

Request an
e-inspection copy

Share this Title