Generic asymptotic expansions
[ Homepage | Publications | Talks | TeXmacs | Mathemagix ]


We give an expansion algorithm for germs of exp-log functions at infinity which is correct modulo Schanuel's conjecture. We also show how the algorithm can be made generic. More precisely, we reduce the expansion algorithm for exp-log functions depending on parameters to the problem of deciding whether a given system of exp-log equations and inequalities in several variables admits a solution.

Keywords: Asymptotic expansion, exp-log function, algorithm, genericity

View: Gzipped Postscript, BibTeX

Note: this work was also presented at the 5-th Rhine workshop for computer algebra.