A natural sequel to the author's previous book Combinatorial Matrix Theory written with H. J. Ryser, this is the first book devoted exclusively to existence questions, constructive algorithms, enumeration questions, and other properties ...
The first edition of this book was reviewed in 1982 as "the most extensive treatment of Pade approximants actually available." This second edition has been thoroughly updated, with a substantial new chapter on multiseries approximants.
The starting point of this book is Sperner's theorem, which answers the question: What is the maximum possible size of a family of pairwise (with respect to inclusion) subsets of a finite set?
The new edition has several significant changes, most prominently the addition of exercises for solution. These are intended to supplement the text, but lemmas needed in a proof are never relegated to the exercises.
Providing clear exposition, deep mathematical results, and superb technical representation, they are masterpieces of the subject of stochastic analysis and nonlinear filtering....These books...will become classics." --SIAM REVIEW
The first edition of this book was reviewed in 1982 as "the most extensive treatment of Pade approximants actually available." This second edition has been thoroughly updated, with a substantial new chapter on multiseries approximants.
The new edition also contains a chapter on multiseries approximants. The book contains an extensive bibliography of recent monographs on other specialized material.