Softcover ISBN:  9780821845127 
Product Code:  MMONO/59 
List Price:  $104.00 
MAA Member Price:  $93.60 
AMS Member Price:  $83.20 
Electronic ISBN:  9781470444730 
Product Code:  MMONO/59.E 
List Price:  $104.00 
MAA Member Price:  $93.60 
AMS Member Price:  $83.20 

Book DetailsTranslations of Mathematical MonographsVolume: 59; 1984; 286 ppMSC: Primary 05; Secondary 32;
This monograph should be of interest to a broad spectrum of readers: specialists in discrete and continuous mathematics, physicists, engineers, and others interested in computing sums and applying complex analysis in discrete mathematics. It contains investigations on the problem of finding integral representations for and computing finite and infinite sums (generating functions); these arise in practice in combinatorial analysis, the theory of algorithms and programming on a computer, probability theory, group theory, and function theory, as well as in physics and other areas of knowledge. A general approach is presented for computing sums and other expressions in closed form by reducing them to onedimensional and multiple integrals, most often to contour integrals.

Table of Contents

Chapters

Introduction

1. The method of integral representation of combinatorial sums

2. Integral representation and computation of onedimensional combinatorial sums

3. Inversion and classification of linear relations in combinatorial analysis

4. Combinatorial interpretation, integral representation, and estimation of certain sums in combinatorial analysis

5. Integral representation and computation of multidimensional sums

6. Applications

7. Open problems


Request Review Copy

Get Permissions
 Book Details
 Table of Contents

 Request Review Copy
 Get Permissions
This monograph should be of interest to a broad spectrum of readers: specialists in discrete and continuous mathematics, physicists, engineers, and others interested in computing sums and applying complex analysis in discrete mathematics. It contains investigations on the problem of finding integral representations for and computing finite and infinite sums (generating functions); these arise in practice in combinatorial analysis, the theory of algorithms and programming on a computer, probability theory, group theory, and function theory, as well as in physics and other areas of knowledge. A general approach is presented for computing sums and other expressions in closed form by reducing them to onedimensional and multiple integrals, most often to contour integrals.

Chapters

Introduction

1. The method of integral representation of combinatorial sums

2. Integral representation and computation of onedimensional combinatorial sums

3. Inversion and classification of linear relations in combinatorial analysis

4. Combinatorial interpretation, integral representation, and estimation of certain sums in combinatorial analysis

5. Integral representation and computation of multidimensional sums

6. Applications

7. Open problems