Abstract
MUCH use is made in combinatorial problems of generating functions in the form of polynomials and infinite power series, these being obtained by the manipulation of other algebraic expressions. In order to save time and improve accuracy in the evaluation of the coefficients, one can, of course, make use of computer programs for doing algebra1,2. But it is often easier to use the following method which relies only on arithmetical operations available in all programming languages.
Similar content being viewed by others
Article PDF
References
Cook, G. B., Reeves, C. M., and Boys, S. F., Nature, 178, 1208 (1956).
Hodgson, L. I., in Machine Intelligence, II (edit. by Dale, E., and Michie, D.), 47 (Oliver and Boyd, Edinburgh and London, 1968).
Weyl, H., The Theory of Groups and Quantum Mechanics, 34 (Methuen, London, 1931).
Good, I. J., Biometrika, 17, 185 (1950); Proc. Camb. Phil. Soc., 47, 756 (1951); ibid., 51, 385 (1955); J. Roy. Stat. Soc. B, 20, 361 (1958); ibid., 22, 372 (1960); Amer. Math. Monthly, 69, 259 (1962).
IEEE Trans. Audio Electronics, AU-15, No. 2 (June 1967).
Good, I. J., Ann. Math. Stat., 28, 861 (1957); ibid., 32, 535 (1961).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
GOOD, I. Polynomial Algebra: an Application of the Fast Fourier Transform. Nature 222, 1302 (1969). https://doi.org/10.1038/2221302a0
Received:
Issue Date:
DOI: https://doi.org/10.1038/2221302a0
This article is cited by
-
Integration over a simplex, truncated cubes, and Eulerian numbers
Numerische Mathematik (1978)
Comments
By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.