Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra: In Honour of Peter Paule on his 60th Birthday

Author:   Veronika Pillwein ,  Carsten Schneider
Publisher:   Springer Nature Switzerland AG
Edition:   1st ed. 2020
ISBN:  

9783030445614


Pages:   410
Publication Date:   30 September 2021
Format:   Paperback
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Our Price $232.85 Quantity:  
Add to Cart

Share |

Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra: In Honour of Peter Paule on his 60th Birthday


Add your own review!

Overview

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.

Full Product Details

Author:   Veronika Pillwein ,  Carsten Schneider
Publisher:   Springer Nature Switzerland AG
Imprint:   Springer Nature Switzerland AG
Edition:   1st ed. 2020
Weight:   0.652kg
ISBN:  

9783030445614


ISBN 10:   3030445615
Pages:   410
Publication Date:   30 September 2021
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Table of Contents

When the search for solutions can be terminated.- Euler’s partition theorem and refinement without appeal to infinit.- Sequences in partitions, double q-series and the Mock Theta Function.- Refine q-trinomial coecients and two infinit 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.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List