Standard bases and some computations in rings of power series

  • Authors:
  • Thomas Becker

  • Affiliations:
  • -

  • Venue:
  • Journal of Symbolic Computation
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

We prove the existence of standard bases and unique remainder for ideals in power series rings with respect to arbitrary admissible term order. Several characterizations of standard bases are shown to be equivalent. We give an algorithm that computes the unique remainder of a power series modulo a principal ideal with respect to the lexicographical term order. The algorithm applies to the Weierstrass preparation theorem.