Generatingfunctionologyby: Herbert S Wilf
|
|
Reviews
[Write a review of this article]
There are no reviews of this article
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
AbstractThis 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, including the cycle index of the symmetric group, permutations and square roots, counting polyominoes, and exact covering sequences. An appendix on using the computer algebra programs MAPLE(r) and <I>Mathematica</I>(r) to generate functions is also included. The book provides a clear, unified introduction to the basic enumerative applications of generating functions, and includes exercises and solutions, many new, at the end of each chapter.<br><br>Key Features<br>* Provides <B>new applications</b> on the cycle index of the symmetric group, permutations and square roots, counting polyominoes, and exact covering sequences<br>* Features an <B>Appendix</b> on using <B>MAPLE(r)</b> and <B><I>Mathematica (r)</b></i> to generate functions<br>* Includes many <B>new exercises with complete solutions</b> at the end of each chapter
BibTeX record
RIS record