The Concrete Tetrahedron [recurso electrónico] : Symbolic Sums, Recurrence Equations, Generating Functions, Asymptotic Estimates / by Manuel Kauers, Peter Paule.
Tipo de material:
TextoSeries Texts and Monographs in Symbolic Computation, A Series of the Research Institute for Symbolic Computation, Johannes Kepler University Linz, AustriaEditor: Vienna : Springer Vienna : Imprint: Springer, 2011Descripción: IX, 203 p. online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9783709104453Tema(s): Mathematics | Algebra | Combinatorics | Number theory | Mathematics | Combinatorics | Discrete Mathematics | Number Theory | AlgebraFormatos físicos adicionales: Printed edition:: Sin títuloClasificación CDD: 511.6 Clasificación LoC:QA164-167.2Recursos en línea: Libro electrónico
| Tipo de ítem | Biblioteca actual | Colección | Signatura | Copia número | Estado | Fecha de vencimiento | Código de barras |
|---|---|---|---|---|---|---|---|
| Libro Electrónico | Biblioteca Electrónica | Colección de Libros Electrónicos | QA164 -167.2 (Browse shelf(Abre debajo)) | 1 | No para préstamo | 376985-2001 |
1 Introduction -- 2 Formal Power Series -- 3 Polynomials -- 4 C-Finite Sequences -- 5 Hypergeometric Series -- 6 Algebraic Functions -- 7 Holonomic Sequences and Power Series -- Appendix -- References -- 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.
19
