Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
Integral Representation and the Computation of Combinatorial Sums
 
Integral Representation and the Computation of Combinatorial Sums
eBook ISBN:  978-1-4704-4473-0
Product Code:  MMONO/59.E
List Price: $155.00
MAA Member Price: $139.50
AMS Member Price: $124.00
Integral Representation and the Computation of Combinatorial Sums
Click above image for expanded view
Integral Representation and the Computation of Combinatorial Sums
eBook ISBN:  978-1-4704-4473-0
Product Code:  MMONO/59.E
List Price: $155.00
MAA Member Price: $139.50
AMS Member Price: $124.00
  • Book Details
     
     
    Translations of Mathematical Monographs
    Volume: 591984; 286 pp
    MSC: 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 one-dimensional 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 one-dimensional 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 multi-dimensional sums
    • 6. Applications
    • 7. Open problems
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Permission – for use of book, eBook, or Journal content
    Accessibility – to request an alternate format of an AMS title
Volume: 591984; 286 pp
MSC: 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 one-dimensional 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 one-dimensional 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 multi-dimensional sums
  • 6. Applications
  • 7. Open problems
Review Copy – for publishers of book reviews
Permission – for use of book, eBook, or Journal content
Accessibility – to request an alternate format of an AMS title
Please select which format for which you are requesting permissions.