Auteur: Herbert S. Wilf

This is the Second Edition of the highly successful introduction to the use of generating functions and series in combinatorial mathematics. This new edition includes several new areas of application …

Generating functions, one of the most important tools in enumerative combinatorics, are a bridge between discrete mathematics and continuous analysis. Generating functions have numerous applications …

Combinatorial Algorithms for Computers and Calculators, Second Edition deals with combinatorial algorithms for computers and calculators. Topics covered range from combinatorial families such as the …

Generatingfunctionology provides information pertinent to generating functions and some of their uses in discrete mathematics. This book presents the power of the method by giving a number of example …

Hardy, Littlewood and P6lya’s famous monograph on inequalities [17J has served as an introduction to hard analysis for many mathema- ticians. Some of its most interesting results center around Hilber …

This book offers advanced undergraduates and graduate students in physics, engineering, and other natural sciences a solid foundation in several fields of mathematics. Clear and well-written, it assu …

This book is of interest to mathematicians and computer scientists working in finite mathematics and combinatorics. It presents a breakthrough method for analyzing complex summations. Beautifully wri …