Sale!

Algorithmic Combinatorics Enumerative Combinatorics Special Functions and Computer Algebra 1st edition by Veronika Pillwein, Carsten Schneider ISBN 3030445593 9783030445591

Name: Algorithmic Combinatorics Enumerative Combinatorics Special Functions and Computer Algebra 1st edition by Veronika Pillwein, Carsten Schneider ISBN 3030445593 9783030445591
SKU: EB-22456228
Availability: InStock

Original price was: $50.00.Current price is: $25.00.

Algorithmic Combinatorics Enumerative Combinatorics Special Functions and Computer Algebra In Honour of Peter Paule on his 60th Birthday Veronika Pillwein Digital Instant Download

Author(s): Veronika Pillwein, Carsten Schneider

ISBN(s): 9783030445584, 9783030445591, 3030445585, 3030445593

Edition: 1st ed.

File Details: PDF, 7.10 MB

Year: 2020

Language: English

SKU: EB-22456228 Category: Computers Tags: Carsten Schneider, Veronika Pillwein

Description

Algorithmic Combinatorics Enumerative Combinatorics Special Functions and Computer Algebra 1st edition by Veronika Pillwein, Carsten Schneider – Ebook PDF Instant Download/Delivery:3030445593 , 978-3030445591
Full download Algorithmic Combinatorics Enumerative Combinatorics Special Functions and Computer Algebra 1st Edition after payment

Product details:

ISBN 10: 3030445593
ISBN 13: 978-3030445591
Author: Veronika Pillwein, Carsten Schneider

The book is centered around the research areas of combinatorics, special functions, and computer algebra. What these research fields share is that many of their outstanding results do not only have applications in Mathematics, but also other disciplines, such as computer science, physics, chemistry, etc. A particular charm of these areas is how they interact and influence one another. For instance, combinatorial or special functions’ techniques have motivated the development of new symbolic algorithms. In particular, first proofs of challenging problems in combinatorics and special functions were derived by making essential use of computer algebra. This book addresses these interdisciplinary aspects. Algorithmic aspects are emphasized and the corresponding software packages for concrete problem solving are introduced. Readers will range from graduate students, researchers to practitioners who are interested in solving concrete problems within mathematics and other research disciplines.

Algorithmic Combinatorics Enumerative Combinatorics Special Functions and Computer Algebra 1st Table of contents:

When the Search for Solutions Can Be Terminated
Euler’s Partition Theorem and Refinements Without Appeal to Infinite Products
Sequences in Partitions, Double q-Series, and the Mock Theta Function ρ3(q)
Refined q-Trinomial Coefficients and Two Infinite Hierarchies of q-Series Identities
Large Scale Analytic Calculations in Quantum Field Theories
An Eigenvalue Problem for the Associated Askey–Wilson Polynomials
Context-Free Grammars and Stable Multivariate Polynomials over Stirling Permutations
An Interesting Class of Hankel Determinants
A Sequence of Polynomials Generated by a Kapteyn Series of the Second Kind
Comparative Analysis of Random Generators
Difference Equation Theory Meets Mathematical Finance
Evaluations as L-Subsets
Exact Lower Bounds for Monochromatic Schur Triples and Generalizations
Evaluation of Binomial Double Sums Involving Absolute Values
On Two Subclasses of Motzkin Paths and Their Relation to Ternary Trees
A Theorem to Reduce Certain Modular Form Relations Modulo Primes
Trying to Solve a Linear System for Strict Partitions in ‘Closed Form’
Untying the Gordian Knot via Experimental Mathematics