Algorithms of integral representation of combinatorial sums and their applications

Описание

Тип публикации: доклад, тезисы доклада, статья из сборника материалов конференций

Конференция: International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 00); MOSCOW, RUSSIA; MOSCOW, RUSSIA

Год издания: 2000

Аннотация: 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.

Ссылки на полный текст

Издание

Журнал: FORMAL POWER SERIES AND ALGEBRAIC COMBINATORICS

Номера страниц: 15-29

Место издания: BERLIN

Издатель: SPRINGER-VERLAG BERLIN

Авторы

Вхождение в базы данных