Introduction to Combinatorial Analysis

By John Riordan

Book Overview

This book introduces combinatorial analysis to the beginning student. The author begins with the theory of permutation and combinations and their applications to generating functions. In subsequent chapters, he presents Bell polynomials; the principle of inclusion and exclusion; the enumeration of permutations in cyclic representation; the theory of distributions; partitions, compositions, trees and linear graphs; and the enumeration of restricted permutations. Originally published in 1980. The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.

• Format: Paperback
• Language: English
• ISBN: 0691023654
• ISBN13: 9780691023656
• Release Date: September 1980
• Publisher: Princeton University Press
• Length: 256 Pages
• Weight: 0.75 lbs.
• Dimensions: 0.5" x 6.1" x 9.2"

Customer Reviews

A very good old text

The thing that borthers me is the archadic notation used in parts of this book and notation used with no reference that I can find. I really learned a lot in reading this book and intend to try to get more out of it in the future, but I really wouldn't use this as an introductory text as some of the theorems an problems are graduate or post graduate level. It is a useful and helpful book for those intent on understanding combinatorial theory.

Dated, but excellent

As a "hobby mathematician", I had had exposure to this subject while studying related topics (e.g. random graphs), but this was the first book I studied, which was dedicated ot combinatorics only. The book seems easy reading, but I have a feel, a real mathematician will find a lot of depth in this book. Generating functions are explained in great detail. It is obviously written in the older style, not in the Definition-Theorem-Proof style, which I find easier to read. Still, it is a simple yet rigorous introduction into the field of combinatorics

A tangible account of something not so tangible

I find combinatorics to be unattainable past the elements of combinatorics. In this introduction I can at least feel like I am walking away with something especially from the finer details and intracacies.

A Classic Text in the Subject

This is a text which, while considered an introduction and perhaps a bit dated nowadays, requires some of the closest attention I have ever had to pay to a mathematical work. If I may call this book a mathematical gold mine, I must also say that in parts the digging is arduous and rewarding and the rock can be of high density. The section in chapter 2, on derivatives of composite functions (essentially Bell Polynomials, after the famous Eric Temple Bell), is an example. This is at least my third pass through the book and this time I decided not to slough over some of the details on these polynomials. I found myself bewildered for a couple of days, as the author gives no assistance to the reader--no doubt to help the reader develop some of that mathematical maturity mentioned in the preface--and found gold thereby. Statements made apparently as an aside, such as "completely determined..." had not been paid adequate attention by me. Also, it was not pointed out by the author that certain constants evaluated in the examples were found by setting the variable to zero, and so on. This is all left to the reader to dig out. In a span of two or three pages in this section there are hours of profitable work left to the reader. This is not a complaint, but rather a statement of the level of audience addressed by this book. It is not a text for readers who require hand-holding. However, anyone who is prepared to dig will experience the "joy of finding things out", if I may humbly steal a favored phrase of the late, great Richard P. Feynman.