Skip to main content

The Order Function

  • Chapter
  • 487 Accesses

Part of the book series: Algorithms and Computation in Mathematics ((AACIM,volume 1))

Abstract

We introduce in this chapter the order function at an element, which will be our main tool later when we prove the correctness of the integration algorithm. The usefulness of this function is that it maps elements of arbitrary unique factorization domains into integers, so applying it on both sides of an equation produces equations and inequalities involving integers, making it possible to either prove that the original equation cannot have a solution, or to compute estimates for the orders of its solutions. Therefore it is used in many contexts besides integration, for example in algorithms for solving differential equations. While we use only the order function at a polynomial in the integration algorithm, we introduce it here in unique factorization domains of arbitrary characteristic, and study its properties in the general case when the order is taken at an element that is not necessarily irreducible.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bronstein, M. (1997). The Order Function. In: Symbolic Integration I. Algorithms and Computation in Mathematics, vol 1. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-03386-9_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-03386-9_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-03388-3

  • Online ISBN: 978-3-662-03386-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics