Insight on the structure of differential ideals defined by coherent autoreduced set allows one to uncouple the differential and algebraic computations in a decomposition algorithm. Original results as well as concise new proofs of already presented theorems are exposed. As a consequence, an effectiv
Algorithms and methods in differential algebra
β Scribed by Jean Moulin Ollagnier
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 854 KB
- Volume
- 157
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Let \(k\) be a field, \(S=k\left[x_{v}: v \in V\right]\) be the polynomial ring over the finite set of variables ( \(x_{v}: v \in V\) ), and \(m=\left(x_{v}: v \in V\right)\) the ideal defining the origin of Spec S. It is theoretically known (see e.g. Alonso et al., 1991) that the algorithmic ideas
This paper describes three algorithms for q-hypergeometric summation: β’ a multibasic analogue of Gosper's algorithm, β’ the q-Zeilberger algorithm, and β’ an algorithm for finding q-hypergeometric solutions of linear recurrences together with their Maple implementations, which is relevant both to pe
In this paper we present three different approaches for the determination of conservation laws. For three corresponding REDUCE computer algebra programs CONLAW1/2/3 the necessary subroutines are described. All three programs use subroutines which remove redundant functions and constants in the gener