Abstract
While computer algebra systems have dealt with polynomials and rational functions with integer coefficients for many years, dealing with more general constructs from commutative algebra is a more recent problem. In this paper we explain how one system solves this problem, what types and operators it is necessary to introduce and, in short, how one can construct a computational theory of commutative algebra. Of necessity, such a theory is rather different from the conventional, non-constructive, theory. It is also somewhat different from the theories of Seidenberg [1974] and his school, who are not particularly concerned with practical questions of efficiency.
Preview
Unable to display preview. Download preview PDF.
References
[Abbott et al., 1985] Abbott, J.A., Bradford, R.J. & Davenport, J.H., A Remark on Factorisation. SIGSAM Bulletin 19(1985) 2, pp. 31–33, 37.
Bareiss, E.H., Sylvester's Identity and Multistep Integer-preserving Gaussian Elimination. Math. Comp. 22(1968) pp. 565–578.
[Bradford et al., 1986] Bradford, R.J., Hearn, A.C., Padget, J.A. & Schrüfer, E., Enlarging the REDUCE Domain of Computation. Proc. SYMSAC 86 (ACM, New York, 1986) pp. 100–106.
Brown, W.S., Rational Exponential Expressions, and a conjecture concerning π and e. Amer. Math. Monthly 76(1969) pp. 28–34.
Collins, G.E., PM, a system for polynomial multiplication. Comm. ACM 9(1969) pp. 578–589.
Davenport, J.H., On the Integration of Algebraic Functions. Springer Lecture Notes in Computer Science 102, Springer-Verlag, Berlin-Heidelberg-New York, 1981 [Russian ed. MIR, Moscow, 1985].
Davenport, J.H., Effective Mathematics — the Computer Algebra viewpoint. Proc. Constructive Mathematics Conference 1980 (ed. F. Richman) Springer Lecture Notes in Mathematics 873, Springer-Verlag, Berlin-Heidelberg-New York, 1981], pp. 31–43.
Davenport, J.H. & Padget, J.A., HEUGCD: How Elementary Upperbounds Generate Cheaper Data. Proc. EUROCAL 85, Vol. 2 (Springer Lecture Notes in Computer Science 204, Springer-Verlag, Berlin-Heidelberg-New York, 1985) pp. 18–28
Davenport, J.H. & Padget, J.A., On Numbers & Polynomials. Computers and Computing (ed. P. Chenin, C. Dicrescenzo, F. Robert), Masson and Wiley, 1985, pp. 49–53.
Davenport, J.H. & Trager, B.M., Scratchpad's View of Algebra I: Commutative Algebra. IBM Research Report RC 14897 and University of Bath Computer Science Technical Report 90–31, January 1990.
Fröhlich, A. & Shepherdson, J.C., Effective Procedures in Field Theory. Phil. Trans. Roy. Soc. Ser. A 248(1955–6) pp. 407–432.
[Gianni et al., 1988] Gianni, P., Trager, B.M. & Zacharias, G., Gröbner Bases and Primary Decomposition of Polynomial Ideals. J. Symbolic Comp. 6(1988) pp. 149–167.
Hearn, A.C., Non-Modular Computation of Polynomial Gcd Using Trial Division. Proc. EUROSAM 79 (Springer Lecture Notes in Computer Science 72, Springer-Verlag, Berlin-Heidelberg-New York) pp. 227–239.
Hermite, E., Sur l'intégration des fractions rationelles. Nouvelles Annales de Mathématiques, 2 Sér., 11(1872) pp. 145–148. Ann. Scientifiques de l'École Normale Supérieure, 2 Sér., 1(1872) pp. 215–218.
Jenks, R.D. & Trager, B.M., A Language for Computational Algebra. Proc. SYMSAC 81 (ACM, New York, 1981) pp. 6–13. Reprinted in SIGPLAN Notices 16(1981) No. 11, pp. 22–29.
Moore, P.M.A. & Norman, A.C., Implementing a Polynomial Factorization and GCD Package. Proc. SYMSAC 81 (ACM, New York, 1981) pp. 109–116.
Seidenberg, A., Constructions in Algebra. Trans. AMS 197(1974) pp. 273–313.
Stoutemyer, D.R., Which Polynomial Representation is Best: Surprises Abound. Proc. 1984 MACSYMA Users' Conference (ed. V.E. Golden), G.E., Schenectady, pp. 221–243.
Trager,B.M., Algebraic Factoring and Rational Function Integration. Proc. SYMSAC 76 (ACM, New York, 1976) pp. 219–226.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Davenport, J.H., Trager, B.M. (1990). Scratchpad's view of algebra I: Basic commutative algebra. In: Miola, A. (eds) Design and Implementation of Symbolic Computation Systems. DISCO 1990. Lecture Notes in Computer Science, vol 429. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52531-9_122
Download citation
DOI: https://doi.org/10.1007/3-540-52531-9_122
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52531-8
Online ISBN: 978-3-540-47014-4
eBook Packages: Springer Book Archive