Integer relation detection
- 1 January 2000
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computing in Science & Engineering
- Vol. 2 (1) , 24-28
- https://doi.org/10.1109/5992.814653
Abstract
Practical algorithms for integer relation detection have become a staple in the emerging discipline of experimental mathematics-using modern computer technology to explore mathematical questions. After briefly discussing the problem of integer relation detection, the author describes several recent, remarkable applications of these techniques in both mathematics and physics.Keywords
This publication has 13 references indexed in Scilit:
- Parallel integer relation detection: Techniques and applicationsMathematics of Computation, 2000
- Massive 3-loop Feynman diagrams reducible to SC $^*$ primitives of algebras of the sixth root of unityThe European Physical Journal C, 1999
- Analysis of PSLQ, an integer relation finding algorithmMathematics of Computation, 1999
- On the rapid computation of various polylogarithmic constantsMathematics of Computation, 1997
- Association of multiple zeta values with positive knots via Feynman diagrams up to 9 loopsPhysics Letters B, 1997
- A Fortran 90-based multiprecision systemACM Transactions on Mathematical Software, 1995
- Explicit evaluation of Euler sumsProceedings of the Edinburgh Mathematical Society, 1995
- Experimental Evaluation of Euler SumsExperimental Mathematics, 1994
- Algorithm 719: Multiprecision translation and execution of FORTRAN programsACM Transactions on Mathematical Software, 1993
- Generalization of the Euclidean algorithm for real numbers to all dimensions higher than twoBulletin of the American Mathematical Society, 1979