Algebraic Diagonals and Walks: Algorithms, Bounds, Complexity - Archive ouverte HAL Access content directly
Journal Articles Journal of Symbolic Computation Year : 2017

Algebraic Diagonals and Walks: Algorithms, Bounds, Complexity

Alin Bostan
  • Function : Author
  • PersonId : 831654
Bruno Salvy

Abstract

The diagonal of a multivariate power series F is the univariate power series Diag(F) 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 Diag(F) is an algebraic function. We propose an algorithm that computes an annihilating polynomial for Diag(F). 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.

Dates and versions

hal-01244914 , version 1 (16-12-2015)

Identifiers

Cite

Alin Bostan, Louis Dumont, Bruno Salvy. Algebraic Diagonals and Walks: Algorithms, Bounds, Complexity. Journal of Symbolic Computation, 2017, Special issue on the conference ISSAC 2015: Symbolic computation and computer algebra, 83, pp.68-92. ⟨10.1016/j.jsc.2016.11.006⟩. ⟨hal-01244914⟩
233 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More