Concrete Tetrahedron Symbolic Sums, Recurrence Equations, Generating Functions, Asymptotic Estimates
Produktdetaljer
<p>From the reviews:</p><p>“The Concrete Tetrahedron is suitable for advanced undergraduate students in mathematics or computer science who have had some exposure to elementary concepts in abstract algebra and complex analysis. … The volume’s numerous problems together with selected solutions definitely make it appropriate for an independent reading course for the motivated student. Summing Up: Highly recommended. Upper-division undergraduates.” (D. M. Ha, Choice, Vol. 49 (11), July, 2012)</p><p>“The book deals with a blend of continuous and discrete mathematics, applying continuous methods to discrete problems. … Those who are interested in the subject matter of Concrete Mathematics will enjoy The Concrete Tetrahedron for an independent perspective, some more recent results, and for new applications.” (John D. Cook, The Mathematical Association of America, March, 2011)</p>
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.
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.