Algebraic Diagonals and Walks - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

Algebraic Diagonals and Walks

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. Generically, it is its minimal polynomial and is obtained in time quasi-linear in its size. We show that this minimal polynomial has an exponential size with respect to 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-01240729 , version 1 (14-12-2015)

Identifiers

Cite

Alin Bostan, Louis Dumont, Bruno Salvy. Algebraic Diagonals and Walks. ISSAC'15 International Symposium on Symbolic and Algebraic Computation, Jul 2015, Bath, United Kingdom. pp.77-84, ⟨10.1145/2755996.2756663⟩. ⟨hal-01240729⟩
96 View
1 Download

Altmetric

Share

Gmail Facebook X LinkedIn More