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 language | English |
|---|---|
| Pages (from-to) | 623-651 |
| Number of pages | 29 |
| Journal | Foundations of Computational Mathematics |
| Volume | 19 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 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
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver