Search Results for ""

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

A group G is nilpotent if the upper central sequence 1=Z_0<=Z_1<=Z_2<=...<=Z_n<=... of the group terminates with Z_n=G for some n. Nilpotent groups have the property that ...

A normal series of a group G is a finite sequence (A_0,...,A_r) of normal subgroups such that I=A_0<|A_1<|...<|A_r=G.

A null function delta^0(x) satisfies int_a^bdelta^0(x)dx=0 (1) for all a,b, so int_(-infty)^infty|delta^0(x)|dx=0. (2) Like a delta function, they satisfy delta^0(x)={0 x!=0; ...

It is possible to construct simple functions which produce growing patterns. For example, the Baxter-Hickerson function f(n)=1/3(2·10^(5n)-10^(4n)+2·10^(3n)+10^(2n)+10^n+1) ...

Given a sequence {a_k}_(k=1)^n, a partial sum of the first N terms is given by S_N=sum_(k=1)^Na_k.

A curve obtained by fitting polynomials to each ordinate of an ordered sequence of points. The above plots show polynomial curves where the order of the fitting polynomial ...

A knot obtained from a tangle which can be represented by a finite sequence of integers.

A precise sequence of instructions designed to accomplish a given task. The implementation of an algorithm on a computer using a programming language is an example of a ...

A slightly archaic term for a computer-generated random number. The prefix pseudo- is used to distinguish this type of number from a "truly" random number generated by a ...