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

Carsten Schneider

ISBN 10: 3030445615 / ISBN 13: 9783030445614

Published by Springer International Publishing, 2021

About this Item

Druck auf Anfrage Neuware - Printed after ordering - 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.

Seller Inventory # 9783030445614

Bibliographic Details

• Title: Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra : In Honour of Peter Paule on his 60th Birthday
• Publisher: Springer International Publishing
• Publication Date: 2021
• Language: English
• ISBN 10: 3030445615
• ISBN 13: 9783030445614
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 24D millimeters 235 millimeters width by 155 millimeters height by 24 millimeters depth
• Weight: 645 grams

About this title

Synopsis

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.