Search Results for ""

A search algorithm of a graph which explores all nodes adjacent to the current node before moving on. For cyclic graphs, care must be taken to make sure that no nodes are ...

A tensor-like coefficient which gives the difference between partial derivatives of two coordinates with respect to the other coordinate, ...

The comparability graph of a partially ordered set P=(X,<=) is the graph with vertex set X for which vertices x and y are adjacent iff either x<=y or y<=x in P.

A complex map is a map f:C->C. The following table lists several common types of complex maps. map formula domain complex magnification f(z)=az a in R, a>0 complex rotation ...

A subset tau in S_n of a permutation {1,...,n} is said to contain alpha in S_k if there exist 1<=i_1<...<i_k<=n such that tau=(tau_i,...,tau_k) is order isomorphic to ...

The covercosine, also called the coversed cosine, is a little-used trigonometric function defined by covercos(z) = vercos(1/2pi-z) (1) = 1+sinz, (2) where vercosz is the ...

A cube 35-compound can be constructed as the dual of the octahedron 35-compound. It will be implemented in a future version of the Wolfram Language as ...

int_0^inftye^(-omegaT)cos(omegat)domega=T/(t^2+T^2), which can be computed using integration by parts.

The dihedral group D_2 is a point group that is isomorphic to the vierergruppe and the finite group C_2×C_2.

An expansion based on the roots of x^(-n)[xJ_n^'(x)+HJ_n(x)]=0, where J_n(x) is a Bessel function of the first kind, is called a Dini expansion.