Search Results for ""

An estimation technique which is insensitive to small departures from the idealized assumptions which have been used to optimize the algorithm. Classes of such techniques ...

|_n]={n for n!=0; 1 for n=0. (1)

The m×n rook complement graph K_m square K_n^_ is the graph complement of the m×n rook graph. It has vertex count mn and edge count 2(m; 2)(n; 2), where (n; k) is a binomial ...

A graph G whose line graph is L(G) is called the root graph R(L(G)) of L(G). In order words, R(L(G))=G. The root graph of a connected graph is unique except for K_3=C_3 (the ...

The root lattice of a semisimple Lie algebra is the discrete lattice generated by the Lie algebra roots in h^*, the dual vector space to the Cartan subalgebra.

There is a one-to-one correspondence between the sets of equivalent correspondences (not of value 0) on an irreducible curve of curve genus p, and the rational collineations ...

In the illusion illustrated above, when the concentric square borders with rounded edges are rotated slowly, the entire pattern appears to pulsate radially.

The rotation operator can be derived from examining an infinitesimal rotation (d/(dt))_(space)=(d/(dt))_(body)+omegax, where d/dt is the time derivative, omega is the angular ...

If the matrices A, X, B, and C satisfy AX-XB=C, then [I X; 0 I][A C; 0 B][I -X; 0 I]=[A 0; 0 B], where I is the identity matrix.

An n-route is defined as a walk of length n with specified initial point in which no line succeeds itself.