1. An algorithm, say mfoldHyper, that computes bases of the subspaces of all m-fold (m being a positive integer) hypergeometric term solutions of holonomic recurrence equations. This algorithm is new, and it has the advantage to linearize the computation of Laurent-Puiseux series: every linear combination of hypergeometric type series, even for many different values of m, is detected.
2. An algorithm that computes normal form representations for non-holonomic functions. A very important consequence of this algorithm is its ability to prove difficult identities.
3. A variant of van Hoeij's algorithm for computing hypergeometric term solutions of holonomic recurrence equations. Following the main steps of van Hoeij's algorithm, my variant computes hypergeometric term solutions of holonomic recurrence equations as fast as the original algorithm while using other methods. This algorithm is an integral part of mfoldHyper mentioned in 1.
Related papers can be found under the section Papers of the website.
Power series computed in Maxima thanks to mfoldHyper
Zero equivalence detected in Maple thanks to the second result of my Ph.D.
This is my first contact with the subject of my Ph.D. thesis. Notice that in this essay the hypergeometric type series is reduced to those whose recurrence equations with only two terms are immediately found.
The main purpose here is to model the birth, growth, and mortality of species of trees in the forest. The EM algorithm is used for clustering. Concerning the regression, the growth and the mortality are modeled using the binomial distribution, and the birth is modeled using the Poisson distribution.