Cantitate/Preț
Produs

generatingfunctionology: Third Edition

Autor Herbert S. Wilf
en Limba Engleză Hardback – 20 dec 2005
Generating functions, one of the most important tools in enumerative combinatorics, are a bridge between discrete mathematics and continuous analysis.
Citește tot Restrânge

Preț: 41492 lei

Preț vechi: 51865 lei
-20%

Puncte Express: 622

Preț estimativ în valută:
7331 8451$ 6401£

Carte disponibilă

Livrare economică 25 aprilie-09 mai
Livrare express 11-17 aprilie pentru 3272 lei


Specificații

ISBN-13: 9781568812793
ISBN-10: 1568812795
Pagini: 256
Dimensiuni: 152 x 229 x 16 mm
Greutate: 0.51 kg
Ediția:Revizuită
Editura: CRC Press
Colecția A K Peters/CRC Press

Public țintă

Academic and Postgraduate

Recenzii

" ""Wilf's writing is clear and friendly; his exorcises are instructive and plentiful... This book is valuable reading for even the best of specialists..."" -E. Rodney Canfield, The Mathematical Intelligencer , March 1993
""This is a first rate, carefully planned and executed book written by a 'black belt gereratingfunctionologist.' I'll be using it the next time I teach..."" -George Andrews, SIAM News, October 1994
""Wilf's book is very well-written and easy to read by any serious mathematics student. Scientists in other disciplines often encounter the need to study sequences that naturally arise in their own discipline. The book is well-suited fo them, too."" -Short Book Reviews, January 2006"

Cuprins

Introductory Ideas and Examples. Series. Cards, Decks and Hands: The Exponential Formula. Applications of Generating Functions. Analytic and Asymptotic Models. Appendix: Using Maple and Mathematica Solutions. References.


Notă biografică

Herbert S. Wilf


Descriere

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 in mathematics, especially in - Combinatorics - Probability Theory - Statistics - Theory of Markov Chains - Number Theory One of the most important and relevant recent applications of combinatorics lies in the development of Internet search engines whose incredible capabilities dazzle even the mathematically trained user.