P-adic reconstruction of rational numbers

ABSTRACT

In a recent paper, Wang [1981] introduces a p-adic algorithm for the construction of partial fraction decompositions. This differs from the usual p-adic algorithms for factorisation or the computation of greatest common divisors ([Wang, 1978], [Wang, 1980], [Moore & Norman, 1981]) in that the p-adic image is used to reconstruct rational numbers, rather than integers.

REFERENCES

• 1: Hardy & Wright, 1979, Hardy, G. H. & Wright, E. M., An Introduction to the Theory of Numbers (5th. ed.). Clarendon Press, Oxford, 1979.
• 2: Donald E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997
• 3: P. M. A. Moore , A. C. Norman, Implementing a polynomial factorization and GCD package, Proceedings of the fourth ACM symposium on Symbolic and algebraic computation, p.109-116, August 05-07, 1981, Snowbird, Utah, United States [doi>10.1145/800206.806379]
• 4: Wang, 1978, Wang, P. S., An Improved Multivariable Polynomial Factorising Algorithm. Math. Comp. 32(1978) pp. 1215--1231. Zbl. 388.10035.
• 5: Paul S. Wang, The EEZ-GCD algorithm, ACM SIGSAM Bulletin, v.14 n.2, p.50-60, May 1980 [doi>10.1145/1089220.1089228]
• 6: Paul S. Wang, A p-adic algorithm for univariate partial fractions, Proceedings of the fourth ACM symposium on Symbolic and algebraic computation, p.212-217, August 05-07, 1981, Snowbird, Utah, United States [doi>10.1145/800206.806398]