The Concrete Tetrahedron

Symbolic Sums, Recurrence Equations, Generating Functions, Asymptotic Estimates
Buch | Softcover
IX, 203 Seiten
2010 | 2011
Springer Wien (Verlag)
978-3-7091-0444-6 (ISBN)

Lese- und Medienproben

The Concrete Tetrahedron - Manuel Kauers, Peter Paule
74,89 inkl. MwSt
This book examines four mathematical concepts which play a great role in many different areas of mathematics: symbolic sums, recurrence (difference) equations, generating functions, and asymptotic estimates.

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.

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)

Erscheint lt. Verlag 1.12.2010
Reihe/Serie Texts & Monographs in Symbolic Computation
Zusatzinfo IX, 203 p.
Verlagsort Vienna
Sprache englisch
Maße 155 x 235 mm
Gewicht 375 g
Themenwelt Mathematik / Informatik Mathematik Algebra
Mathematik / Informatik Mathematik Arithmetik / Zahlentheorie
Mathematik / Informatik Mathematik Graphentheorie
Schlagworte asymptotics • combinatorics • Formal power series • recurrence equations • Symbolic Computation • symbolic summation • Tetraeder
ISBN-10 3-7091-0444-0 / 3709104440
ISBN-13 978-3-7091-0444-6 / 9783709104446
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Wie bewerten Sie den Artikel?
Bitte geben Sie Ihre Bewertung ein:
Bitte geben Sie Daten ein:
Mehr entdecken
aus dem Bereich
Begriffe, Sätze und zahlreiche Beispiele in kurzen Lerneinheiten

von Christian Karpfinger

Buch | Softcover (2022)
Springer Spektrum (Verlag)
54,99