Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The diagonal of a multivariate por series  F  is the univariate por series Diag  F  generated by the diagonal terms of  F . Diagonals form an important class of por series; they occur frequently in number theory, theoretical physics and enumerative combinatorics.  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.  propose an algorithm that computes an annihilating polynomial for Diag  F .  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.  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 por series of bridges, excursions and meanders.  show that their first  N  terms can be computed in quasi-linear complexity in  N , without first computing a very large polynomial equation.
['Alin Bostan', 'Louis Dumont', 'Bruno Salvy']
I am writing a research paper on a idea Algebraic Diagonals and Walks: Algorithms, Bounds, Complexity
[{"from": "human", "value": "I am writing a research paper on a idea Algebraic Diagonals and Walks: Algorithms, Bounds, Complexity"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The diagonal of a multivariate por series  F  is the univariate por series Diag\u00a0 F  generated by the diagonal terms of  F . Diagonals form an important class of por series; they occur frequently in number theory, theoretical physics and enumerative combinatorics.  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\u00a0 F  is an algebraic function.  propose an algorithm that computes an annihilating polynomial for Diag\u00a0 F .  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.  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 por series of bridges, excursions and meanders.  show that their first  N  terms can be computed in quasi-linear complexity in  N , without first computing a very large polynomial equation."}]