Texts & Monographs in Symbolic Computation

This book demonstrates how to formally model various mathematical domains (including algorithms operating in these domains) in a way that makes them amenable to a fully automatic analysis by computer software.The presented domains are typically …

This volume gives an up-to-date review of the subject Integration in Finite Terms. The book collects four significant texts together with an extensive bibliography and commentaries discussing these works and their impact. These texts, either out …

This book uses new mathematical tools to examine broad computability and complexity questions in enumerative combinatorics, with applications to other areas of mathematics, theoretical computer science, and physics. A focus on effective algorithms …

This book describes some basic principles that allow developers of computer programs (computer scientists, software engineers, programmers) to clearly think about the artifacts they deal with in their daily work: data types, programming languages …

This volume comprises review papers presented at the Conference on Antidifferentiation and the Calculation of Feynman Amplitudes, held in Zeuthen, Germany, in October 2020, and a few additional invited reviews.

The book aims at comprehensive …

In this book, origami is treated as a set of basic geometrical objects that are represented and manipulated symbolically and graphically by computers. Focusing on how classical and modern geometrical problems are solved by means of origami, the …

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 …

This book includes review articles in the field of elliptic integrals, elliptic functions and modular forms intending to foster the discussion between theoretical physicists working on higher loop calculations and mathematicians working in the …

This is the first book devoted to the task of computing integrability structures by computer. The symbolic computation of integrability operator is a computationally hard problem and the book covers a huge number of situations through tutorials.

The papers in this volume aim at obtaining a common understanding of the challenging research questions in web applications comprising web information systems, web services, and web interoperability; obtaining a common understanding of verification n

The book focuses on advanced computer algebra methods and special functions that have striking applications in the context of quantum field theory. It presents the state of the art and new methods for (infinite) multiple sums, multiple integrals, in

The book presents the state of the art and results and also includes articles pointing to future developments. Most of the articles center around the theme of linear partial differential equations. Major aspects are fast solvers in elastoplasticity,

The central subject of the book is the generalization of Loewy's decomposition - originally introduced by him for linear ordinary differential equations - to linear partial differential equations. Equations for a single function in two independent va

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 isolati

Approximate Commutative Algebra is an emerging field of research which endeavours to bridge the gap between traditional exact Computational Commutative Algebra and approximate numerical computation. The last 50 years have seen enormous progress in th

J. Kung and G.-C. Rota, in their 1984 paper, write: “Like the Arabian phoenix rising out of its ashes, the theory of invariants, pronounced dead at the turn of the century, is once again at the forefront of mathematics”. The book of Sturmfels is both

This is a new type of calculus book: Students who master this text will be well versed in calculus and, in addition, possess a useful working knowledge of one of the most important mathematical software systems, namely, MACSYMA. This will equip …

The development of polynomial-elimination techniques from classical theory to modern algorithms has undergone a tortuous and rugged path. This can be observed L. van der Waerden's elimination of the "elimination theory" chapter from from B. his …

The well attended March 1994 HIse workshop in Amsterdam was a very lively con­ ference which stimulated much discussion and human-human interaction. As the editor of this volume points out, the Amsterdam meeting was just part of a year-long …

George Collins’ discovery of Cylindrical Algebraic Decomposition (CAD) as a method for Quantifier Elimination (QE) for the elementary theory of real closed fields brought a major breakthrough in automating mathematics with recent important …