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.
This is the first book devoted to the task of computing integrability structures by computer. The symbolic computation of integrability operator is a ...
This book describes some basic principles that allow developers of computer programs (computer scientists, software engineers, programmers) to clearlythinkabout the artifacts they deal with in their daily work: data types, programming languages, programs written in these languages that compute from given inputs wanted outputs, and programs that describe continuously executing systems. The core message is that clear thinking about programs can be expressed in a single universal language, the formal language oflogic. Apart from its universal elegance and expressiveness, this “logical”...
This book describes some basic principles that allow developers of computer programs (computer scientists, software engineers, programmers) to clearly...
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 surveys and new innovative results of the analytic integration methods of Feynman integrals in quantum field theory. These methods are closely related to the field of special functions and their function spaces, the theory of differential equations and summation theory. Almost all of these algorithms have a strong basis in computer algebra. The solution of...
This volume comprises review papers presented at the Conference on Antidifferentiation and the Calculation of Feynman Amplitudes, held in Zeuthen, Ger...
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 investigated in discrete mathematics, logic, algebra, and computer science; they are modeled in a formal language based on first-order logic which is sufficiently rich to express the core entities in whose correctness we are interested: mathematical theorems and algorithmic specifications. This formal language is the language of RISCAL, a...
This book demonstrates how to formally model various mathematical domains (including algorithms operating in these domains) in a way that makes them a...