The concrete tetrahedron : symbolic sums, recurrence equations, generating functions, asymptotic estimates / Manuel Kauers, Peter Paule

Auteur principal : Kauers, Manuel, 1979-, AuteurCo-auteur : Paule, Peter, 1958-, AuteurType de document : MonographieCollection : Texts and monographs in symbolic computationLangue : anglais.Pays: Autriche.Éditeur : Wien : Springer, cop. 2011Description : 1 vol. (IX-203 p.) : fig. ; 24 cmISBN: 9783709104446.ISSN: 0943-853X.Bibliographie : Bibliogr. p.193-195. Index.Sujet MSC : 05-01, Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics
05A15, Enumerative combinatorics, Exact enumeration problems, generating functions
11B37, Number theory - Sequences and sets, Recurrences
68W30, Algorithms in computer science, Symbolic computation and algebraic computationEn-ligne : Sommaire | Zentralblatt | MathSciNet
Tags from this library: No tags from this library for this title. Log in to add tags.
Holdings
Item type Current library Call number Status Date due Barcode
Monographie Monographie CMI
Salle 1 		05 KAU (Browse shelf(Opens below)) Available 12322-01

Bibliogr. p.193-195. Index

The book treats four mathematical concepts which play a fundamental role in many different areas of mathematics: symbolic sums, recurrence (difference) equations, generating functions, and asymptotic estimates. Their key features, in isolation or in combination, their mastery by paper and pencil or by computer programs, and their applications to problems in pure mathematics or to "real world problems" (e.g. the analysis of algorithms) are studied. The book is intended as an algorithmic supplement to the bestselling "Concrete Mathematics" by Graham, Knuth and Patashnik. (Source : Springer)

There are no comments on this title.

to post a comment.