# polynomial

(redirected from Polynomials)
Also found in: Dictionary, Thesaurus, Encyclopedia.

## polynomial

(pŏl′ē-nō′mē-əl)
Of, relating to, or consisting of more than two names or terms.
n.
1. A taxonomic designation consisting of more than two terms.
2. Mathematics
a. An algebraic expression consisting of one or more summed terms, each term consisting of a constant multiplier and one or more variables raised to nonnegative integral powers. For example, x2 - 5x + 6 and 2p3q + y are polynomials. Also called multinomial.
b. An expression of two or more terms.

## polynomial

a relationship between two variables such that y = a + bx + cx2 + ... qxn. A straight line is y = a + bx. Any curve can be approximated with a polynomial formula.
Mentioned in ?
References in periodicals archive ?
It is also worth mentioning that in  Buch obtained the Littlewood-Richardson rule for the structure constants of Grothendieck polynomials [G.
Four interesting and useful theorems about polynomials.
The new class of polynomials is introduced in Section 3.
Generally, the family of polynomials (2) is robustly stable if and only if p(*, q) is stable for all q [member of] Q, i.
It was observed that the solutions of polynomials of the type ax = b(mod polynomial congruences, was equally good for the of bits in the answer was in general proportional to .
Our primary motivation to study the Tutte polynomial came from the remarkable connection between the Tutte and the Jones polynomials that up to a sign and multiplication by a power of t the Jones polynomial of an alternating link is equal to the Tutte polynomial [19, 16, 11].
In Section 2 we present two different expressions for the Laurent polynomials of Hermite interpolation whose nodes are the roots of complex unimodular numbers.
2 The Murgnahan-Nakayama rule for Schubert polynomials.
A CODE TO CALCULATE HIGH ORDER LEGENDRE POLYNOMIALS AND FUNCTIONS
Now, after we overviewed the mathematical integer representation we can start to view our scheme as based on polynomials, which use the integer representation to construct the coefficients of polynomial used, then apply Pederson's shares verification algorithm and then generate the shares and verification shares, with the difference that the secret will be the value f (g), where g is the base in g -adic,the shares verification will be as in Pederson's VSS.
Note that we look for complex Darboux polynomials in real differential systems.
Gegenbauer polynomials are particular solutions of the Gegenbauer differential equation

Site: Follow: Share:
Open / Close