Algebraic extensions of arbitrary integral domains
The theory of using a polynomial to create an algebraic field extension is well-defined in mathematical literature and the technique is commonly used in symbolic computation. Even when extensions are not over a field, monics polynomials are often used to extend rings (e.g., the Gaussian Integers can be formed as ℤ[x]/x2+1). As long as only algebraic integers are introduced (i.e., the extension is monic), the computational methods are straightforward and the algorithms and supporting theory are known.
The intent of this paper is to develop the theory and algorithms necessary to understand and accommodate the use of non-monic extensions in a symbolic computing system. None of the computer algebra systems currently in operation allow such extensions. It will be shown, however, that these restrictions place an unnecessary bound on user capabilities since non-monic extension algorithms can be implemented practically and efficiently.
KeywordsComputer Algebra System Algebraic Extension Greatest Common Divisor Binary Rational User Capability
Unable to display preview. Download preview PDF.
- Aho, A. V.; Hopcroft, J. E.; and Ullman, J. D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.Google Scholar
- Brown, W. S.: On Euclid's Algorithm and the Computation of Polynomial Greatest Divisors. JACM, vol. 18, no. 4, Oct. 1971, pp 478–504.Google Scholar
- Herstein, I. N.: Topics in Algebra. Blaisdell Pub., New York, 1964.Google Scholar
- Lang, Serge: Algebraic Numbers. Addison-Wesley, Reading, Mass., 1964.Google Scholar
- Trager, Barry M.: Algebraic Factoring and Rational Function Integration. Procedings of 1976 ACM Symposium on Symbolic and Algebraic Computation, R. D. Jenks, ed., Aug. 1976, pp. 219–226.Google Scholar
- Yun, David Y. Y. and Stoutemyer, David R.: Symbolic Mathematical Computation (Computer Algebra). Book to be published by Addison-Wesley, System Programming Series, 1979.Google Scholar