Search Results for ""

The maximal independence polynomial I_G(x) for the graph G may be defined as the polynomial I_G(x)=sum_(k=i(G))^(alpha(G))s_kx^k, where i(G) is the lower independence number, ...

The symbol × used to denote multiplication, i.e., a×b denotes a times b. The symbol × is also used to denote a group direct product, a Cartesian product, or a direct product ...

Neville's algorithm is an interpolation algorithm which proceeds by first fitting a polynomial of degree 0 through the point (x_k,y_k) for k=1, ..., n, i.e., P_k(x)=y_k. A ...

Any irreducible curve may be carried by a factorable Cremona transformation into one with none but ordinary singular points.

An algebra which does not satisfy a(bc)=(ab)c is called a nonassociative algebra.

An 18-sided polygon, sometimes also called an octakaidecagon.

The central point (r=0) in polar coordinates, or the point with all zero coordinates (0, ..., 0) in Cartesian coordinates. In three dimensions, the x-axis, y-axis, and z-axis ...

The Paley class of a positive integer m=0 (mod 4) is defined as the set of all possible quadruples (k,e,q,n) where m=2^e(q^n+1), (1) q is an odd prime, and k={0 if q=0; 1 if ...

A result in control theory. Define H(psi,x,u)=(psi,f(x,u))=sum_(a=0)^npsi_af^a(x,u). Then in order for a control u(t) and a trajectory x(t) to be optimal, it is necessary ...

A probabilistic experiment is an occurrence such as the tossing of a coin, rolling of a die, etc. in which the complexity of the underlying system leads to an outcome that ...