Coefficient Fields of Solutions in Kovacic's Algorithm
โ Scribed by Alexey Zharkov
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 188 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
โฆ Synopsis
In this paper we prove the following theorem: if the Riccati equation (w^{\prime}+w^{2}=R(x), R \in) (Q(x)), has algebraic solutions, then there exists a minimum polynomial defining such a solution whose coefficients lie at most in a cubic extension of the field (Q). In Zharkov (1992), the same result was erroneously stated for, at most, quadratic extensions of (Q). However, M. Singer discovered that in some cases the cubic extensions are necessary. Here we give a corrected and more detailed proof of the theorem.
๐ SIMILAR VOLUMES
Based on Gosper's algorithm for indefinite hypergeometric summation, Zeilberger's algorithm for proving binomial coefficient identities constitutes a recent breakthrough in symbolic computation. Mathematica implementations of these algorithms are described. Nontrivial examples are given in order to
NOTATION a = effective interfacial area, sq. c = constant in Equation (5) D = diffusivity of solute in gas, sq. ft./hr. D, = diameter of sphere possessing the same surface area a s a piece of packing, f t . f t .I cu.ft. G = superficial gas rate, 1b.I (hr.) h, = operating holdup, cu.ft./cu.ft. li, =