Skip to main navigation Skip to search Skip to main content

Effective Power Series Computations

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)

Abstract

Let K be an effective field of characteristic zero. An effective tribe is a subset of K[[z1, z2, …]] = K∪ K[[z1]] ∪ K[[z1, z2]] ∪ ⋯ that is effectively stable under the K-algebra operations, restricted division, composition, the implicit function theorem, as well as restricted monomial transformations with arbitrary rational exponents. Given an effective tribe with an effective zero test, we will prove that an effective version of the Weierstrass division theorem holds inside the tribe and that this can be used for the computation of standard bases.

Original languageEnglish
Pages (from-to)623-651
Number of pages29
JournalFoundations of Computational Mathematics
Volume19
Issue number3
DOIs
Publication statusPublished - 15 Jun 2019

Keywords

  • Algorithm
  • Power series
  • Standard basis
  • Tribe
  • Weierstrass preparation
  • d-Algebraic power series

Fingerprint

Dive into the research topics of 'Effective Power Series Computations'. Together they form a unique fingerprint.

Cite this