Algorithms of integral representation of combinatorial sums and their applications

From MaRDI portal





Egorychev summarizes his approach to combinatorial analysis by integral representation of combinatorial sums. The results in his classic book \textit{G. P. Egorychev} [Integral representation and the calculation of combinatorial sums (Russian) (Akademiya Nauk SSSR, Sibirskoe Otdelenie, Novosibirsk) (1977; Zbl 0453.05001) (English: Transl. Math. Monogr. Vol. 59 (Providence, Rhode Island: AMS)) (1984; Zbl 0524.05001)] has been extended by many papers. There is an emphasis on the computational side, i.e. a computational scheme is described for using the integral representation method for evaluating combinatorial sums. For the entire collection see [Zbl 0941.00013].











This page was built for publication: Algorithms of integral representation of combinatorial sums and their applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4502519)