Search Results for ""

The approximating polynomial which has the smallest maximum deviation from the true function. It is closely approximated by the Chebyshev polynomials of the first kind.

Polynomials s_k(x) which form the Sheffer sequence for f(t)=-(2t)/(1-t^2) (1) and have exponential generating function ...

The polynomial giving the number of colorings with m colors of a structure defined by a permutation group.

The power polynomials x^n are an associated Sheffer sequence with f(t)=t, (1) giving generating function sum_(k=0)^inftyx^kt^k=1/(1-tx) (2) and exponential generating ...

A polynomial with coefficients in a field is separable if its factors have distinct roots in some extension field.

The distance polynomial is the characteristic polynomial of the graph distance matrix. The following table summarizes distance polynomials for some common classes of graphs. ...

The Euler polynomial E_n(x) is given by the Appell sequence with g(t)=1/2(e^t+1), (1) giving the generating function (2e^(xt))/(e^t+1)=sum_(n=0)^inftyE_n(x)(t^n)/(n!). (2) ...

The polynomials a_n^((beta))(x) given by the Sheffer sequence with g(t) = (1-t)^(-beta) (1) f(t) = ln(1-t), (2) giving generating function ...

Polynomials O_n(x) that can be defined by the sum O_n(x)=1/4sum_(k=0)^(|_n/2_|)(n(n-k-1)!)/(k!)(1/2x)^(2k-n-1) (1) for n>=1, where |_x_| is the floor function. They obey the ...

Polynomials s_k(x;lambda,mu) which are a generalization of the Boole polynomials, form the Sheffer sequence for g(t) = (1+e^(lambdat))^mu (1) f(t) = e^t-1 (2) and have ...