Synopses & Reviews
This is the second of three volumes which present, in an original way, some of the most important tools of applied mathematics in areas such as probability theory, operator calculus, representation theory, and special functions, used in solving problems in mathematics, physics and computer science. This second volume - Special Functions and Computer Science - presents some applications of special functions in computer science. It largely consists of adaptations of articles that have appeared in the literature, but here they are presented in a format made accessible for the non-expert by providing some context. The material on group representation and Young tableaux is introductory in nature. The algebraic approach of Chapter 2 is original to the authors and has not appeared previously. Similarly, the material and approach based on Appell states, so formulated, is presented here for the first time. The solutions are tackled with the help of various analytical techniques, such as generating functions and probabilistic methods and insights appear regularly. For pure and applied mathematicians and theoretical computer scientists. It is suitable for selfstudy by researchers, as well as being appropriate as a text for a course or advanced seminar.
Table of Contents
Preface. Introduction.
1. Basic Data Structures.
2. Data Structures and Orthogonal Polynomials.
3. Applications of Bessel Functions and Lommel Polynomials.
4. Fourier Transform on Finite Groups and Related Transforms.
5. Young Tableaux and Combinatorial Enumeration in Parallel Processing. References. Index.