Integral Representation and Algorithms for Closed Form Summation : монография

Описание

Тип публикации: глава из книги

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

Идентификатор DOI: 10.1016/S1570-7954(07)05009-7

Аннотация: The problem of computation and estimation of finite and infinite sums (generating functions) often arises in combinatorics and graph theory, theory of algorithms and computer algebra, group theory and function theory, probability theory and asymptotical analysis as well as in physics, statistical mechanics, and other areas of knowlПоказать полностьюedge. This article is intended for a wide audience including graduate students and researchers in the various applied fields. Here we present the history, main results, model examples, various applications and perspectives of investigation in two connected general approaches to summation: the integral representation and computation of combinatorial sums ("the method of coefficients") and the modern algorithmic approach. Each of the approaches is based on classic results of mathematical analysis, function theory and computer algebra.

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

Издание

Журнал: HANDBOOK OF ALGEBRA, VOL 5

Выпуск журнала: Vol. 5

Номера страниц: 459-529

ISSN журнала: 15707954

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

Издатель: NORTH HOLLAND, ELSEVIER SCIENCE PUBL BV

Авторы

  • Egorychev G.P. (Krasnoyarsk State Technical University)
  • Zima E.V. (Physics and Computer Science,Wilfrid Laurier University)

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