Overview
- Concrete mathematics from a computer algebra perspective
- Informal style: as simple as possible, as complicated as necessary
- Includes notivating applications from combinatorics, computer science, number theory, special functions
- Includes supplementary material: sn.pub/extras
Part of the book series: Texts & Monographs in Symbolic Computation (TEXTSMONOGR)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (7 chapters)
Keywords
About this book
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.
Reviews
From the reviews:
“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)
“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)
Authors and Affiliations
Bibliographic Information
Book Title: The Concrete Tetrahedron
Book Subtitle: Symbolic Sums, Recurrence Equations, Generating Functions, Asymptotic Estimates
Authors: Manuel Kauers, Peter Paule
Series Title: Texts & Monographs in Symbolic Computation
DOI: https://doi.org/10.1007/978-3-7091-0445-3
Publisher: Springer Vienna
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag/Wien 2011
Softcover ISBN: 978-3-7091-0444-6Published: 01 December 2010
eBook ISBN: 978-3-7091-0445-3Published: 15 January 2011
Series ISSN: 0943-853X
Series E-ISSN: 2197-8409
Edition Number: 1
Number of Pages: IX, 203
Topics: Combinatorics, Discrete Mathematics, Number Theory, Algebra