Abstract
For many years mathematicians and scientists have been intrigued with the algebraic, symmetric, and partition properties associated with operations on polynomials such as a 0xn + a1xn-1 + a2xn-2 +…+ an-1x+an. A typical operation is the summation of the kth powers of the roots (without first finding the roots). In the early 1960’s, Fielder [7], [8] developed a tabular approach which generalizes such operations including the above. Known existing examples were systematized, and several additional examples were presented. Undoubtedly there are many more just begging to be discovered.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adams, E.P. Smithsonian Mathematical Formulae and Tables of Elliptic Functions, Washington: Smithsonian Institution, 1947.
Aitken, A.C. Determinants and Matrices, London: Oliver and Boyd, 1956.
Basin, S.L. ‘A Note on Waring’s Formula for Sums of Like Powers of Roots’. The Fibonacci Quarterly, Vol. 2.2 (1964): pp 119–122.
Draim, N.A. and Bicknell, M. ‘Sums of the nth Powers of the Roots of a Given Quadratic Equation’. The Fibonacci Quarterly, Vol. 4.2 (1966): pp. 170–178.
Draim, N.A. and Bicknell, M. ‘Equations Whose Roots Are the nth Powers of the Roots of a Given Cubic Equation’. The Fibonacci Quarterly, Vol. 5 (1967): pp. 267–274.
Draim, N.A. and Bicknell, M. ‘Summation of Powers of Roots of Special Equations’. The Fibonacci Quarterly, Vol. 8 (1970): pp. 221–224.
Fielder, D.C. ‘A Note on Summation of Powers of Roots’. MTAC, Vol. 12 (1958): pp. 194–198.
Fielder, D.C. ‘Tabulation of Coefficients for Operations on Taylor Series’. Mathematics of Computation, Vol. 14 (1960): pp. 339–345.
Fielder, D.C. and Alford, C.O. ‘Some Computer Experiments on Selected Partitions of Numbers’. Mathematics and Computer Education, Vol. 26 (1992): pp. 6–14.
Fielder, D.C. ‘Comments on Time-to-Frequency and Frequency-to-Time Domain Matrix Formulations’. Proceedings IEEE, Vol. 55 (1961): pp. 686–687.
Fielder, D.C. ‘A Combinatorial-Digital Computation of a Network Parameter’. IRE Transactions on Circuit Theory, Vol. CT-8 (1961): pp. 202–209.
ielder, D.C. ‘On an Algebraic Transformation’. IEEE Transactions on Circuit Theory, Vol. CT-10 (1963): pp. 281–283.
Fielder, D.C. ‘Combinatorial Simplification of Multimesh Ladder Network Formulas’. Proceedings IEEE, Vol. 53 (1965): pp. 747–748.
Fielder, D.C. ‘Certain Lucas-like Sequences and Their Generation by Partitions of Numbers’. The Fibonacci Quarterly, Vol. 5 (1967): pp. 319–324.
Fielder, D.C. ‘Remarks on Two Related Sequences of Numbers’. The Fibonacci Quarterly, Vol. 5 (1967): pp. 325–328.
Pipes, L.A. Operational Methods in Nonlinear Mechanics. New York: Dover, 1965.
Reis, G.C. ‘A Frequency-to-Time Domain Formulation’. Proceedings IEEE, Vol. 54 (1966): pp. 1962–1963.
Sloane, N.J.A. A Handbook of Integer Sequences, New York: Academic Press, 1973.
Stanley, W.D. ‘A Time-to-Frequency Domain Matrix Formulation’. Proceedings IEEE, Vol. 52 (1954): pp. 874–875.
Van Orstrand, C.E. ‘The Reversion of Power Series’. Philosophical Magazine, Vol. 19 (1910): pp. 366–376.
Wolfram Research, Inc. Mathematica, Ver. 2. Champaign, IL: Wolfram Research Inc., 1991.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Fielder, D.C., Alford, C.O. (1996). More Applications of a Partition Driven Symmetric Table. In: Bergum, G.E., Philippou, A.N., Horadam, A.F. (eds) Applications of Fibonacci Numbers. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-0223-7_9
Download citation
DOI: https://doi.org/10.1007/978-94-009-0223-7_9
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-6583-2
Online ISBN: 978-94-009-0223-7
eBook Packages: Springer Book Archive