Algebraic diagonals and walks: Algorithms, bounds, complexity

The diagonal of a multivariate power series F is the univariate power series DiagF generated by the diagonal terms of F. Diagonals form an important class of power series; they occur frequently in number theory, theoretical physics and enumerative combinatorics. We study algorithmic questions relate...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of symbolic computation Vol. 83; pp. 68 - 92
Main Authors:	Bostan, Alin, Dumont, Louis, Salvy, Bruno
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.11.2017 Elsevier
Series:	Special issue on the conference ISSAC 2015: Symbolic computation and computer algebra
Subjects:	Algorithms Computer Science Diagonals Symbolic Computation Walks 68W30 33F10 Algorithms 05A15 Walks Diagonals walks algorithms
ISSN:	0747-7171, 1095-855X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!