z-logo
open-access-imgOpen Access
Polynomial expansions via embedded Pascal’s triangles
Author(s) -
Serge B. Provost,
Wajdi Mohamed Ratemi
Publication year - 2011
Publication title -
acta et commentationes universitatis tartuensis de mathematica
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.276
H-Index - 6
eISSN - 2228-4699
pISSN - 1406-2283
DOI - 10.12697/acutm.2011.15.04
Subject(s) - monomial , mathematics , pascal (unit) , symbolic computation , binomial coefficient , combinatorics , extension (predicate logic) , computation , polynomial , row , algebra over a field , pure mathematics , algorithm , mathematical analysis , computer science , database , programming language
An expansion is given for polynomials of the form (ω + λ1) · · · (ω+λn). The coefficients of the resulting polynomials are related to their roots, and a system of equations that enables one to numerically determine the roots in terms of the coefficients is specified. The case where all the roots λi are equal is considered as well. A multinomial extension to polynomials of the form (x1 + · · · + xI) is then provided. As it turns out, the coefficients of the monomials contained in the resulting polynomial expansion can be determined in terms of the coefficients of the monomials included in the expansion of (x1 + · · · + xI−1) and the rows of embedded Pascal’s triangles of successive orders. An algorithm is provided for generating and concatenating these rows, with the particulars of its implementation by means of the symbolic computation software Mathematica being discussed as well. Potential applications of such expansions to combinatorics and genomics are also suggested.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom