In this volume we will present some applications of special functions in computer science. This largely consists of adaptations of articles that have appeared in the literature . Here they are presented in a format made accessible for the non-expert by providing some context. The material on group representations and Young tableaux is introductory in nature. However, 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 . As in all volumes of this series, this one is suitable for self-study by researchers . It is as well appropriate as a text for a course or advanced seminar . The solutions are tackled with the help of various analytical techniques, such as g- erating functions, and probabilistic methods/insights appear regularly . An interesting feature is that, as has been the case in classical applications to physics, special functions arise- here in complexity analysis. And, as in physics, their appearance indicates an underlying Lie structure. Our primary audience is applied mathematicians and theoretical computer scientists . We are quite sure that pure mathematicians will find this volume interesting and useful as well .
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.
Basic Data Structures.- Data Structures & Orthogonal Polynomials.- Applications of Bessel Functions and Lommel Polynomials.- Fourier Transform on Finite Groups and Related Transforms.- Young Tableaux and Combinatorial Enumeration in Parallel Processing.
Inhaltsverzeichnis
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.
Klappentext
In this volume we will present some applications of special functions in computer science. This largely consists of adaptations of articles that have appeared in the literature . Here they are presented in a format made accessible for the non-expert by providing some context. The material on group representations and Young tableaux is introductory in nature. However, 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 . As in all volumes of this series, this one is suitable for self-study by researchers . It is as well appropriate as a text for a course or advanced seminar . The solutions are tackled with the help of various analytical techniques, such as g- erating functions, and probabilistic methods/insights appear regularly . An interesting feature is that, as has been the case in classical applications to physics, special functions arise- here in complexity analysis. And, as in physics, their appearance indicates an underlying Lie structure. Our primary audience is applied mathematicians and theoretical computer scientists . We are quite sure that pure mathematicians will find this volume interesting and useful as well .
