TOPICS
Search

Search Results for ""


171 - 180 of 947 for Operations on polynomialsSearch Results
The polynomials G_n(x;a,b) given by the associated Sheffer sequence with f(t)=e^(at)(e^(bt)-1), (1) where b!=0. The inverse function (and therefore generating function) ...
A sparse polynomial square is a square of a polynomial [P(x)]^2 that has fewer terms than the original polynomial P(x). Examples include Rényi's polynomial (1) (Rényi 1947, ...
Let P be a polynomial of degree n with derivative P^'. Then ||P^'||_infty<=n||P||_infty, where ||P||_infty=max_(|z|=1)|P(z)|.
max_(a<=x<=b){|f(x)-rho(x)|w(x)}.
A complex polynomial is a polynomial with complex coefficients.
A polynomial form which is the sum of two polynomial forms involving separate sets of variables.
A multivariate polynomial (i.e., a polynomial in more than one variable) with all terms having the same degree. For example, x^3+xyz+y^2z+z^3 is a homogeneous polynomial of ...
A polynomial with real positive coefficients and roots which are either negative or pairwise conjugate with negative real parts.
A polynomial in which the sum of subscripts is the same in each term.
A basis of a modular system M is any set of polynomials B_1, B_2, ... of M such that every polynomial of M is expressible in the form R_1B_1+R_2B_2+..., where R_1, R_2, ... ...
1 ... 15|16|17|18|19|20|21 ... 95 Previous Next

...