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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of symbolic computation Ročník 83; s. 68 - 92
Hlavní autoři: Bostan, Alin, Dumont, Louis, Salvy, Bruno
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Ltd 01.11.2017
Elsevier
Edice:Special issue on the conference ISSAC 2015: Symbolic computation and computer algebra
Témata:
Algorithms
Computer Science
Diagonals
Symbolic Computation
Walks
68W30
33F10
Algorithms
05A15
Walks
Diagonals
walks
algorithms
ISSN:0747-7171, 1095-855X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 related to diagonals in the case where F is the Taylor expansion of a bivariate rational function. It is classical that in this case DiagF is an algebraic function. We propose an algorithm that computes an annihilating polynomial for DiagF. We give a precise bound on the size of this polynomial and show that, generically, this polynomial is the minimal polynomial and that its size reaches the bound. The algorithm runs in time quasi-linear in this bound, which grows exponentially with the degree of the input rational function. We then address the related problem of enumerating directed lattice walks. The insight given by our study leads to a new method for expanding the generating power series of bridges, excursions and meanders. We show that their first N terms can be computed in quasi-linear complexity in N, without first computing a very large polynomial equation.
ISSN:0747-7171
1095-855X
DOI:10.1016/j.jsc.2016.11.006