Search Results for ""

Given a field F and an extension field K superset= F, if alpha in K is an algebraic element over F, the minimal polynomial of alpha over F is the unique monic irreducible ...

The polynomials M_k(x;delta,eta) which form the Sheffer sequence for g(t) = {[1+deltaf(t)]^2+[f(t)]^2}^(eta/2) (1) f(t) = tan(t/(1+deltat)) (2) which have generating function ...

(1) where H_n(x) is a Hermite polynomial (Watson 1933; Erdélyi 1938; Szegö 1975, p. 380). The generating function ...

Polynomials b_n(x) which form a Sheffer sequence with g(t) = t/(e^t-1) (1) f(t) = e^t-1, (2) giving generating function sum_(k=0)^infty(b_k(x))/(k!)t^k=(t(t+1)^x)/(ln(1+t)). ...

A modified set of Chebyshev polynomials defined by a slightly different generating function. They arise in the development of four-dimensional spherical harmonics in angular ...

For p(z)=a_nz^n+a_(n-1)z^(n-1)+...+a_0, (1) polynomial of degree n>=1, the Schur transform is defined by the (n-1)-degree polynomial Tp(z) = a^__0p(z)-a_np^*(z) (2) = ...

The term "over" is commonly used in mathematical exposition as a synonym for "in the domain of." So, for example, "Let f be a function over the reals" means "Let f be a ...

Calculus II

The root separation (or zero separation) of a polynomial P(x) with roots r_1, r_2, ... is defined by Delta(P)=min_(i!=j)|r_i-r_j|. There are lower bounds on how close two ...

An algorithm that can be used to factor a polynomial f over the integers. The algorithm proceeds by first factoring f modulo a suitable prime p via Berlekamp's method and ...