By G. P. Egorychev

This monograph may be of curiosity to a huge spectrum of readers: experts in discrete and non-stop arithmetic, physicists, engineers, and others attracted to computing sums and using complicated research in discrete arithmetic. It comprises investigations at the challenge of discovering imperative representations for and computing finite and countless sums (generating functions); those come up in perform in combinatorial research, the idea of algorithms and programming on a working laptop or computer, likelihood idea, team concept, and serve as concept, in addition to in physics and different parts of information. A common technique is gifted for computing sums and different expressions in closed shape by way of lowering them to one-dimensional and a number of integrals, generally to contour integrals.

Read or Download Integral Representation and the Computation of Combinatorial Sums. Trans. from the Russian (Translations of Mathematical Monographs) VOL 59 PDF

Best Combinatorics books

Bent Functions: Results and Applications to Cryptography

Bent features: effects and functions to Cryptography deals a special survey of the items of discrete arithmetic referred to as Boolean bent capabilities. As those maximal, nonlinear Boolean capabilities and their generalizations have many theoretical and functional purposes in combinatorics, coding concept, and cryptography, the textual content offers an in depth survey in their major effects, offering a scientific review in their generalizations and purposes, and contemplating open difficulties in category and systematization of bent services.

A First Course in Combinatorial Mathematics (Oxford Applied Mathematics and Computing Science Series)

Now in a brand new moment variation, this quantity offers a transparent and concise remedy of an more and more very important department of arithmetic. a different introductory survey whole with easy-to-understand examples and pattern difficulties, this article comprises info on such simple combinatorial instruments as recurrence kin, producing capabilities, occurrence matrices, and the non-exclusion precept.

Winning Solutions (Problem Books in Mathematics)

This ebook offers the mathematical instruments and problem-solving event had to effectively compete in high-level challenge fixing competitions. each one part offers very important historical past info after which offers quite a few labored examples and routines to assist bridge the space among what the reader might already comprehend and what's required for high-level competitions.

Combinatorial Designs: A Tribute to Haim Hanani (Annals of Discrete Mathematics)

Haim Hanani pioneered the recommendations for developing designs and the speculation of pairwise balanced designs, prime on to Wilson's lifestyles Theorem. He additionally led the way in which within the learn of resolvable designs, masking and packing difficulties, latin squares, 3-designs and different combinatorial configurations.

Extra resources for Integral Representation and the Computation of Combinatorial Sums. Trans. from the Russian (Translations of Mathematical Monographs) VOL 59

Show sample text content

Rated 4.34 of 5 – based on 3 votes