Applications of Computer Algebra pp 95-111 | Cite as

# Applications of Symbolic Mathematics to Mathematics

Chapter

## Abstract

Some of the most interesting applications of symbolic mathematics are in mathematics itself. Areas of both pure and applied mathematics, including coding theory, cryptography, probability theory, analysis, combinatorics, and number theory, have all gained from the availability of the new symbolic manipulation tools. These tools have been used to prove a number of results directly. Their main application, however, has been to obtain insight into behavior of various mathematical objects, which then led to conventional proofs being constructed.

## Keywords

Computer Algebra Number Field Computer Algebra System Discrete Logarithm Finite Simple Group
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## Preview

Unable to display preview. Download preview PDF.

## References

- [1]E. Bombieri, Thompson’s problem
*(σ*^{2}= 3), (with appendices by A. Odlyzko and D. Hunt),*Inventiones math*.**58**(1980), 77–100.MathSciNetMATHCrossRefGoogle Scholar - [2]W. S. Brown,
*ALTRAN User’s Manual*, 4th ed., Bell Laboratories 1977.Google Scholar - [3]J. Calmet and J. A. van Hulzen, Computer algebra applications, pp. 245–258 in
*Computer Algebra*, B. Buchberger, G. E. Collins, and R. Loos, eds.,*Computing Suppl*.**4**(1982), Springer.CrossRefGoogle Scholar - [4]C. A. Cole, S. Wolfram, et ah,
*SMP-Handbook*, Caltech 1981.Google Scholar - [5]K. O. Geddes, G. H. Gonnet, and B. W. Char,
*MAPLE User’s Manual*, Univ. of Waterloo, 1983.Google Scholar - [6]L. J. Guibas and A. M. Odlyzko, String overlaps, pattern matching, and nontransitive games,
*J*.*Comb. Theory (A)***30**(1981), 183–208.MathSciNetMATHCrossRefGoogle Scholar - [7]L. J. Guibas and A. M. Odlyzko, Long repetitive patterns in random sequences, Z.
*Wahrscheinlichkeits v. Geb*.**53**(1980), 241–262.MathSciNetMATHCrossRefGoogle Scholar - [8]R. W. Hamming,
*Numerical Methods for Scientists and Engineers*, 2nd ed., McGraw Hill 1973.MATHGoogle Scholar - [9]O. Martin, A. M. Odlyzko, and S. Wolfram, Algebraic properties of cellular automata,
*Commun. Math. Physics***93**(1984), 219–258.MathSciNetMATHCrossRefGoogle Scholar - [10]MATHLAB Group;
*MACSYMA Reference Manual*, MIT Laboratory for Computer Service 1977.Google Scholar - [11]A. M. Odlyzko, Lower bounds for discriminants of number fields,
*Acta Arith*.**29**(1976), 275–297.MathSciNetMATHGoogle Scholar - [12]A. M. Odlyzko, Periodic oscillations of coefficients of power series that satisfy functional equations,
*Advances in Math*.**44**(1982), 180–205.MathSciNetMATHCrossRefGoogle Scholar - [13]A. M. Odlyzko, Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir’s signature scheme,
*IEEE Trans. Inform. Theory IT-30*(1984), 594–600.Google Scholar - [14]A. M. Odlyzko, Discrete logarithms in finite fields and their cryptographic significance,
*Proc. Eurocrypt 84*, Springer Lecture Notes in Computer Science, to appear.Google Scholar - [15]A. M. Odlyzko and N. J. A. Sloane, New bounds on the number of unit spheres that can touch a unit sphere in
*n*dimensions,*J. Comb. Theory (A)***26**(1979), 210–214.MathSciNetMATHCrossRefGoogle Scholar - [16]A. D. Solov’ev, A combinatorial identity and its application to the problem concerning the first occurrence of a rare event,
*Theory Prob. Appl*.**11**(1966), 276–282.MATHCrossRefGoogle Scholar

## Copyright information

© Kluwer Academic Publishers 1985