Hypergeometric Summation

Modern algorithmic techniques for summation, most of which were introduced in the 1990s, are developed here and carefully implemented in the computer algebra system MapleTM. The algorithms of Fasenmyer, Gosper, Zeilberger, Petkovšek and van Hoeij for hypergeometric summation and recurrence equations, efficient multivariate summation as well as q-analogues of the above algorithms are covered. Similar algorithms concerning differential equations are considered. An equivalent theory of hyperexponential integration due to Almkvist and Zeilberger completes the book. The combination of these results gives orthogonal polynomials and (hypergeometric and q-hypergeometric) special functions a solid algorithmic foundation. Hence, many examples from this very active field are given. The materials covered are suitable for an introductory course on algorithmic summation and will appeal to students and researchers alike.

Significant revision of classic reference in special functions.

The theory of partitions, founded by Euler, has led in a natural way to the idea of basic hypergeometric series, also known as Eulerian series. These series were first studied systematically by Heine, but many early results are attributed to Euler, Gauss, and Jacobi. Today, research in $q$-hypergeometric series is very active, and there are now major interactions with Lie algebras, combinatorics, special functions, and number theory. However, the theory has been developed to such an extent and with such a profusion of powerful and general results that the subject can appear quite formidable to the uninitiated. By providing a simple approach to basic hypergeometric series, this book provides an excellent elementary introduction to the subject. The starting point is a simple function of several variables satisfying a number of $q$-difference equations.The author presents an elementary method for using these equations to obtain transformations of the original function. A bilateral series, formed from this function, is summed as an infinite product, thereby providing an elegant and fruitful result which goes back to Ramanujan. By exploiting a special case, the author is able to evaluate the coefficients of several classes of infinite products in terms of divisor sums. He also touches on general transformation theory for basic series in many variables and the basic multinomial, which is a generalization of a finite sum. These developments lead naturally to the arithmetic domains of partition theory, theorems of Liouville type, and sums of squares.Contact is also made with the mock theta-functions of Ramanujan, which are linked to the rank of partitions. The author gives a number of examples of modular functions with multiplicative coefficients, along with the beginnings of an elementary constructive approach to the field of modular equations. Requiring only an undergraduate background in mathematics, this book provides a rapid entry into the field. Students of partitions, basic series, theta-functions, and modular equations, as well as research mathematicians interested in an elementary approach to these areas, will find this book useful and enlightening. Because of the simplicity of its approach and its accessibility, this work may prove useful as a textbook.

In this book modern algorithmic techniques for summation, most of which have been introduced within the last decade, are developed and carefully implemented in the computer algebra system Maple. The algorithms of Gosper, Zeilberger and Petkovsek on hypergeometric summation and recurrence equations and their q-analogues are covered, and similar algorithms on differential equations are considered. An equivalent theory of hyperexponential integration due to Almkvist and Zeilberger completes the book. The combination of all results considered gives work with orthogonal polynomials and (hypergeometric type) special functions a solid algorithmic foundation. Hence, many examples from this very active field are given. The book is designed for use in the framework of a seminar and it is also suitable for an advanced lecture course in this area.

The Rogers--Ramanujan identities are a pair of infinite series—infinite product identities that were first discovered in 1894. Over the past several decades these identities, and identities of similar type, have found applications in number theory, combinatorics, Lie algebra and vertex operator algebra theory, physics (especially statistical mechanics), and computer science (especially algorithmic proof theory). Presented in a coherant and clear way, this will be the first book entirely devoted to the Rogers—Ramanujan identities and will include related historical material that is unavailable elsewhere.

Computer algebra systems are now ubiquitous in all areas of science and engineering. This highly successful textbook, widely regarded as the 'bible of computer algebra', gives a thorough introduction to the algorithmic basis of the mathematical engine in computer algebra systems. Designed to accompany one- or two-semester courses for advanced undergraduate or graduate students in computer science or mathematics, its comprehensiveness and reliability has also made it an essential reference for professionals in the area. Special features include: detailed study of algorithms including time analysis; implementation reports on several topics; complete proofs of the mathematical underpinnings; and a wide variety of applications (among others, in chemistry, coding theory, cryptography, computational logic, and the design of calendars and musical scales). A great deal of historical information and illustration enlivens the text. In this third edition, errors have been corrected and much of the Fast Euclidean Algorithm chapter has been renovated.

The present book is a continuation of the three-volume work Representation of Lie Groups and Special Functions by the same authors. Here, they deal with the exposition of the main new developments in the contemporary theory of multivariate special functions, bringing together material that has not been presented in monograph form before. The theory of orthogonal symmetric polynomials (Jack polynomials, Macdonald's polynomials and others) and multivariate hypergeometric functions associated to symmetric polynomials are treated. Multivariate hypergeometric functions, multivariate Jacobi polynomials and h-harmonic polynomials connected with root systems and Coxeter groups are introduced. Also, the theory of Gel'fand hypergeometric functions and the theory of multivariate hypergeometric series associated to Clebsch-Gordan coefficients of the unitary group U(n) is given. The volume concludes with an extensive bibliography. For research mathematicians and physicists, postgraduate students in mathematics and mathematical and theoretical physics.