Skip to main content
Log in

Abstract

We give an expansion algorithm for germs of exp-log functions at infinity which is correct modulo Schanuels 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Author information

Authors and Affiliations

Authors

Additional information

Received: March 8, 1996; revised version: November 21

Rights and permissions

Reprints and permissions

About this article

Cite this article

van der Hoeven, J. Generic Asymptotic Expansions. AAECC 9, 25–44 (1998). https://doi.org/10.1007/s002000050094

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002000050094