Algorithms of Integral Representation of Combinatorial Sums and Their Applications

G. P. Egorychev ()
Additional contact information
G. P. Egorychev: Krasnoyarsk State Technical University, Chair of Software of Discrete Apparatus and Systems

A chapter in Formal Power Series and Algebraic Combinatorics, 2000, pp 15-29 from Springer

Abstract: Abstract This article contains investigations on the problem of finding integral representation and computation finite and infinite sums (generating functions) arising in practice in combinatorial analysis, the theory of algorithms and computer algebra, probability theory, group theory, function theory, and so on, as well as in physics and other areas of knowledge. Using the concept “res” (formal residue) and its properties this approach has been extended on sums which supposed a computation in algebra of formal power series of one and several variables over field of real and complex numbers (method of coefficients). Various applications of this method, the list of new problems and some perspectives in further investigations are pointed.

Date: 2000
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-662-04166-6_2

Ordering information: This item can be ordered from
http://www.springer.com/9783662041666

DOI: 10.1007/978-3-662-04166-6_2

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().